Interested to Buy Any Domain ? << Click Here >> for more details...
How to write a code for random pick from 1-1000 numbers?
The output should contain the 10 numbers from the range
1-1000 which should pick randomly, ie ,for each time we run
the code we should get different outputs.
- 12 Answers
- 21142 Views
- NetApp, I also Faced
- E-Mail Answers
Answer Posted / abhradeep chatterjee
I am Sorry, I executed the Code and it does not work.
Thanks to Rama Krishna.
| Is This Answer Correct ? | 1 Yes | 2 No |
Post New Answer View All Answers
what is the c source code for the below output? 5555555555 4444 4444 333 333 22 22 1 1 22 22 333 333 4444 4444 5555555555
How can variables be characterized?
what are # pragma staments?
How many bytes is a struct in c?
How would you use the functions fseek(), freed(), fwrite() and ftell()?
Explain how can I make sure that my program is the only one accessing a file?
Explain what happens if you free a pointer twice?
What is the mean of function?
At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with these names could be kept in that shelf as in this example: bottom of shelf ---> [AAAJKRDFDEWAAYFYYKK]-----Top of shelf. All these packets are to be loaded on cars. The cars are lined in order, so that the packet could be loaded on them. The cars are also named [A, B, C, D, E,………….]. Each Car will load the packet with the same alphabet. So, for example, car ‘A’ will load all the packets with name ‘A’. Each particular car will come at the loading point only once. The cars will come at the loading point in alphabetical order. So, car ‘B’ will come and take all the packets with name ‘B’ from the shelf, then car ‘C’ will come. No matter how deep in the shelf any packet ‘B’ is, all of the ‘B’ packets will be displaced before the ‘C’ car arrives. For that purpose, some additional shelves are provided. The packets which are after the packet B, are kept in those shelves. Any one of these shelves contains only packets, having the same name. For example, if any particular shelf is used and if a packet with name X is in it, then only the packets having names X will be kept in it. That shelf will look like [XXXXXXX]. If any shelf is used once, then it could be used again only if it is vacant. Packets from the initial shelf could be unloaded from top only. Write a program that finds the minimum total number of shelves, including the initial one required for this loading process.
What are identifiers in c?
What is data structure in c programming?
What is the sizeof () a pointer?
What does dm mean sexually?
What is %s and %d in c?
How can you invoke another program from within a C program?
