Interested to Buy Any Domain ? << Click Here >> for more details...
what is the meaning of java that is (J A V A) full form of
JAVA
- 71 Answers
- 264605 Views
- AKS University, Bhel, BNL, BPO, HCL, Peacecon, I also Faced
- E-Mail Answers
Answer Posted / naveen
java comes from coffee.its very hard to learn.if u want to
do coffee lern java
| Is This Answer Correct ? | 19 Yes | 57 No |
Post New Answer View All Answers
Explain About fork()?
Explain why C language is procedural?
What is %s and %d in c?
When the macros gets expanded?
Does c have class?
What is the size of structure in c?
What are valid signatures for the Main function?
in any language the sound structure of that language depends on its a) character set, input/output function, its control structures b) character set, library functions, input/output functions its control structures c) character set, library functions, control sturctures d) character set, operators, its control structures
WRITE A CODE IN C TO SEARCH A FILE FROM NOTEPAD FILE.
What is the difference between procedural and functional programming?
What are the primitive data types in c?
How do we print only part of a string in c?
Do you know the difference between exit() and _exit() function in c?
What is LINKED LIST? How can you access the last element in a linked list?
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.
