Question
Pipe ‘A’ and pipe ‘B’ can fill a cistern in 20
minutes and 15 minutes respectively. Pipe ‘C’ alone can empty the cistern in 12 minutes. If all three pipes are opened together then what is the time taken to fill 50% of the cistern?Solution
Let the capacity of the cistern = 60 units Then, efficiency of pipe ‘A’ = 60/20 = 3 units/minute Efficiency of pipe ‘B’ = 60/15 = 4 units/minute Efficiency of pipe ‘C’ = 60/12 = 5 units/minute So, combined efficiency of pipes ‘A’, ‘B’ and ‘C’ = 3 + 4 – 5 = 2 units/minute 50% of the cistern’s capacity = 30 units Therefore, time taken by all 3 pipes together to fill 50% of the cistern = 30/2 = 15 minutes
Which sorting algorithm divides the array into halves recursively?
In dynamic programming, which principle ensures correctness by solving overlapping subproblems and storing results?
Which of the following operations on a data structure refers to the removal of an element from the front of a queue?
Which of the following algorithms is most appropriate for a sorting task that requires minimal auxiliary space?
In mobile computing, what is the main feature of pervasive computing?
Which of the following is true for the time complexity of binary search?
Recursive problems are implemented by
Which of the following algorithms uses a greedy approach?
The time complexity of computing the all-pairs shortest paths in a dense graph with V vertices using Floyd–Warshall is:
In dynamic programming, overlapping subproblems and _________ are key properties.
Relevant for Exams:
