1) One mason per day how many cu.m work will do as per list given a) Brick work,hollow brick work and cc block work and plastering how many m2 per day 2) one carpenter per day how many m2 will do as well as scaffolding how many m3
12 219717Post New PR Constructions Civil Engineering Interview Questions
-
PR Constructions Civil Engineering Interview Questions (1)
Is declare cursor executable?
Can sports drinks causes wreck teeth?
When defining a new ledger in the special purpose ledger, how can you retrospectively populate fi data for a previous fiscal year?
How to represent ENUMs and SETs internally?
Which is best laravel or codeigniter?
What is the difference between direct and indirect measures?
Explain application life cycle or application states?
Please anyone give answers for all below questions and help ? realtimers please and please share your knowledge.lot of questions left unanswered.
Which function in excel checks whether a condition is true or false?
What does the viewresolver class?
How to undelete a record from recycle bin with the help of dml?
What is the standard unit weight of Cast Iron pipe of 200MM Dia.(pipe specification is IS1538)
What is grails?
How to find the name of the machine where you are running your automation scripts in qtp?
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.
