Interested to Buy Any Domain ? << Click Here >> for more details...
WHAT QUESTION TO BE ASKED IN INTERWIV IN CLERICAL POST IN DHARMADAY AYUKTA RECRUITMENT IN WORLI
20 37419Post New Dharmaday Ayukta Interview Questions
How to Send a file via DCOM ?
What is jakarta struts framework?
What do you mean by pcui cookbook?
Why is chameleon method used in data warehouse?
What is lease financing?
Does chrome use html5?
Which Invoice issued on Central Sale Commercial or Retail?
What does int * mean in c++?
What is #define?
How do you validate the selection criteria of a report? And how do you display initialvalues in a selection screen?
I want to write some certification courses, so friends could you guide me? which certification is best and how to write exam and what tutorials need to be studied,what to do first, I am working on automation tool QTP 9.2
Explain how to create a virtual directory on iis?
Is uikit thread safe?
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 is the use of sign function?
