Question
P alone can finish a piece of work ‘M’ in 6 days
while Q takes 3 days to finish it alone. P, Q and R working together can finish the work ‘N’ which is 12 times of work ‘M’ in 6 days. How long will R take to finish work ‘N’, when working alone?Solution
 Let the work ‘M’ = 6 units (LCM of 6 and 3) Efficiency of P = 6/6 = 1 units Efficiency of Q = 6/3 = 2 units Efficiency of P, Q and R = (6 × 12)/6 = 12 units per day Efficiency of R = 12 – (1 + 2) = 9 units per day Time taken by R to finish work ‘N’ = 72/9 = 8 days
Which of the following is NOT a common wireless security protocol?
Which shortest-path algorithm is appropriate for graphs with non-negative weights and supports decrease-key efficiently for faster performance?
The time complexity of the best case for QuickSort is:
Consider a directed acyclic graph (DAG). The problem of finding the longest path in a DAG (with edge weights) can be solved in:
Which of the following algorithms uses a greedy approach?
Which of the following is true for a min-heap?
The time complexity of computing the all-pairs shortest paths in a dense graph with V vertices using Floyd–Warshall is:
In Data Communication, what protocol is used to ensure reliable transmission of data over a network?
Which of the following sorting algorithms is considered stable (i.e., preserves the relative order of equal elements)?
What is the time complexity of inserting an element in a heap?
