Question
‘M’ alone can complete a work in 18 days. ‘N’ is
50% as efficient as ‘M’. How long will they take to complete the work together?Solution
ATQ,
Let the efficiency of ‘M’ = 6x units/day
Then, total work = 6x × 18 = 108x units
Efficiency of ‘N’ = 6x × 0.5 = 6x × (1/2) = 3x units/day
So, combined efficiency of ‘M’ and ‘N’ = 6x + 3x = 9x units/day
So, time taken by ‘M’ and ‘N’ together to complete the work = 108x / 9x = 12 days
Which algorithm uses a priority queue to repeatedly pick the next closest vertex?
Which data structure supports extraction of both min and max in O(1) time and insertion in O(log n)?
In a Data Analytics pipeline, which of the following is an advantage of using Dimensional Modelling?
Which of the following algorithms is best suited for finding the shortest path in a weighted graph where some edges may have negative weights but no neg...
Which of the following algorithms uses a greedy approach?
Which of the following is shared by the thread of the same process.
Which algorithm finds the longest common subsequence (LCS) of two sequences?
Which of the following is NOT a greedy algorithm?
What is the time complexity of inserting an element in a heap?
Which component of a network ensures that data is delivered to the correct host in a multi-host environment?
