How do you implement one-to-one, one-to-many and many-to- many relationships while designing tables?
1 91523 persons started placementpapers with a capital of Rs.3000 . B invest Rs.600 less than A, C invest Rs.300 less than B. Then what is the share amount of B in a profit of Rs.886 ?
11 19716What is the first action to perform a query? Suppose I have four tables and five joins and my query is getting slow day by day.
4 10722Post New Hexaware Interview Questions
How do you combine formulas in excel?
What is difference between investment order, internal order and accrual orders? : cost center accounting
How to initiate variable in angularjs?
What are the sources generating big data?
What is ip multicast?
Implement two stacks using a single array.
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.
How do you incorporate current design trends in your work?
what is multitask win95
What is ore?
How many strategies are there? : sap bobi
How do I install joomla on windows 10?
To delete a branch what is the command that is used?
What is named native query in hibernate?
What is jsp api?