Answer Posted /

Is This Answer Correct ?    Yes No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

If a highly positively skewed variable has missing values and we replace them with mean, do we underestimate or overestimate the values?

104


What is the use of subtotal function in excel?

310


What is the main parts of jms applications?

465


How do I enable sql encryption?

497


Will you join our company if paid less your current CTC?

1685






What are the ways to assign a certain colour to an element in css?

253


Why the degree of valve plugs and valve seat is slightly different I control valve trim design

1533


Sir/Hi all, I am selected in cgl 2010 for assistant in CSS. I want to know the joining date of this? My address has changed so I am not sure whether any communication has come from DoPT or not. Please tell me the date or the procedure to contact the concerned office. Thanks

1683


Can we sort hashmap?

479


What does a deadlock mean in DB2?

631


In india, according to trade theory above 5 HP motor reqired star delta starter. But we R connect 11 KV motor with 14MW in Direct to line ( With VCB starter combination) Can U Guess, How it is possible ?????

1577


What is database seeding in laravel?

368


What are the different types of hydro schemes?

648


How to display error messages in the visualforce page ?

199


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.

1711