how to pass this entry from tally advance cheque payment for rent advance in 4 installments cheque paid in same days
1 1951Post New SS Trading Interview Questions
Which key gets you the move tool?
What are the advantages of autotransformer?
What is the use of count (*) in sql?
What does e mean in a function?
how get the grand total in master-detail report?
what are the Info Cubes developed in a sap project? Name them and what is the requirement
What are the limitations of jsonp?
Explain what is menu meta data?
If an advertiser improves the quality score of a keyword, this keyword may?
What sort of advantages do businesses have with effective database management? : hana administration
What are the different ways to conditionally display markup, and what is the preferred approach?
which type of media best suitable for pharmaceutical product promotion?
What do you know about TCS as a company?
Why is quicksort faster than merge sort?
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.
