Answer Posted /

Is This Answer Correct ?    Yes No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

by using xpeditor if we want to debug the subpgm, how can you code in x-ped for mai-pgm n sub-pgm ?

1773


Name the different type of tableau?

184


What is meant by current commutation?

638


What do you mean by Function Overloading in java?

611


Why filters are used in mvc?

1






Explain me what is a framework and what are the frameworks available in rc?

512


What can be the ways to increase traffic to a website through digital marketing?

166


what is the different types of backups available in sql server? : Sql server database administration

489


How log4j file is defined?

5


How to get the number of frames on a page?

534


What is difference between query studio and report studio?

516


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.

1721


Can you tell me about frames in html?

428


What is before trigger?

536


Can I upgrade my cpu from 32 to 64 bit?

495