Question
Find the average of the initial quantity of vessel A
and initial quantity of vessel B. Study the data carefully and answer the following questions: There are three types of mixtures in three different vessels A, B and C. The ratio of milk and water in vessel A is 5:2. The ratio of milk and P1 in vessel B is 2:1. The quantity of water in vessel C was equal to that of vessel A. If 28 litres of mixture from vessel A is taken out and poured in vessel B, then the quantity of milk in vessel B becomes 40 litres. If 40% of the mixture from vessel C is taken out then the quantity of P1 in vessel C becomes 15 litres. Ratio of quantities of mixture in B and C is 6:13. Note: P1 is soluble component. Vessel A, B and C do not contain P1, water and milk respectively.Solution
         Milk      Water      P1 A        5x           2x            - B        2y             -            y              C          -             2x Vessel A, => 5x + 2x = 28 => x = 4 Quantity of milk in vessel A = 5x = 20 Quantity of water in vessel A = 2x = 8 Quantity of milk in vessel B, => 2y + 20 = 40 => y = 10 litres Quantity of milk in vessel B = 20 litres Quantity of P1 in vessel C = (1500/60) = 25 litres Now, ratio of quantities of mixture in B and C is 6:13. => 30/C = 6/13 => C = 65 Quantity of mixture in C = 65 litres So, 2x + 25 = 65 => 2x = 40 litres Quantity of milk in vessel A = 40 litres Quantity of water in vessel A = 100 litres 
Required average = (20 + 10 + 100 + 40)/2 = 85
Which algorithm is used for computing Max-Flow in a network?
Given the following code snippet, which operation is performed on the binary tree to produce the output: 4, 2, 5, 1, 3 ?
class Node {Â Â Â Â Â in...Which data structure is most suitable for implementing a priority queue with logarithmic time complexity for insertion and deletion?
Tarjan’s algorithm is used to find:
In C++, which access specifier makes members accessible only from within the class itself and from friend functions/classes?
What is the worst-case time complexity for inserting an element into a hash table that uses separate chaining for collision resolution?
In a graph, what is the maximum number of edges in a simple undirected graph with 'n' vertices?
Time complexity of heap sort is:
Which of the following is true about triggers in a relational database?
What is the primary purpose of an abstract class?
