Interested to Buy Any Domain ? << Click Here >> for more details...
How to Display top 2 salaries for each department WITHOUT using Rank Transformation And WITHOUT using SQL queries in source qualifier.
3 20397Post New Eureka Forbes Interview Questions
Difference between html tags and struts specific html tags
What is the use of RSTART, RLENGTH and match ?
What is wi-fi technology?
Differentiate between response.sendredirect(url) and
What is dynamic xpath?
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.
why did you chose this specific project?
some os have a tree structure file system that limits the depth of a tree and small number of levels.what limit does this have on user? how does this simplify file system design?
Is it configurable or require deployment for all sort of changes?
Explain about Garbage Collector?
How can you define field dependency?
What is rest parameters?
Explain Operational Acceptance Testing with example ?
What is mask and umask in linux?
will mouseevents trigger from a touch? : Blackberry tablet os
