Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...

i want the NIC programmer-B model papaer pattren, iwant the
all model papers?

Answer Posted / rajesh

Could please forward to me also on rajeshsresume@gmail.com

Is This Answer Correct ?    3 Yes 6 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

Write a c program for binary addition of two 8 bit numbers.

4124


To which numbering system can the binary number 1101100100111100 be easily converted to?

1067


What data structure is fastest, on average, for retrieving data: a) Binary Tree b) Hash Table c) Stack

1084


How many types of comments are there in c++?

989


Can c++ be faster than c?

1034


What is std :: flush?

1076


Why main function is special in c++?

1127


Show the application of a dynamic array with the help of an example.

1142


How do you initialize a string in c++?

1003


what you know about c++?

1160


What are c++ data types?

1169


Is map ordered c++?

1098


What is void pointer in c++ with example?

1100


Explain "const" reference arguments in function?

1059


A prime number is a number which is divisible only by itself and 1. Examples of the first few primes are 2, 3, 5, 7, 11. Consider writing a program which can generate prime numbers for you. Your program should read in and set a maximum prime to generate and a minimum number to start with when looking for primes. This program should be able to perform the following tasks: 1. Read the maximum number from user (keyboard input) to look for primes. The program should not return any primes greater than this number. 2. Read the minimum number from user (keyboard input) to look for primes. The program should not return any primes less than this number. 3. Generate and print out every prime number between the maximum prime and minimum number specified by the user.

2174