Question
In how many days can ‘Q’ alone complete the
work? I. P, Q and R together can complete the work in 9`(3)/(13)` days. II. P and Q together can complete the work in 10 days, Q and R together the work together in 20 days, and P and R together can complete the work in 15 days. Each of the questions below consists of a question and two statements numbered I and II given below it. You have to decide whether the data provided in the statements are sufficient to answer the question. Read both the statements and give answer –Solution
From I. (P + Q + R) can do the work in 93/13 days. Hence, from I alone we cannot get the answer. From II. (P + Q)’s one day work = 1/10 part of the work……… (i) (Q + R)’s one day work = 1/20 part of the work……….. (ii) (P + R)’s one day work = 1/15 part of the work………… (iii) ∴ 2(P + Q + R)’s one day work = 1/10 + 1/20 +1/15 = 13/60 ∴ (P + Q + R)’s one day work = 13/120………….. (iv) By subtracting (iii) by (iv), we get Q’s one day work. ∴ Q’s one day work = 13/120 - 1/15 = 5/120 = 1/24 Hence, from II alone we can get the answer.
What will be the output of the following queue implementation using two stacks?
class QueueUsingStacks {Â Â Â Â Â Stacks1 = new Stack <>... Which protocol provides secure authentication by encrypting credentials before transmission and uses a challenge-response mechanism?
What is the time complexity of searching for an element in a sorted array using binary search?
Which traversal method visits the root node first in trees?
Which of the following techniques is most efficient for finding the kth smallest element in a Binary Search Tree (BST)?
In the context of Management Information Systems (MIS), which of the following best describes the role of a decision support system (DSS)?
Which of the following integrity constraints ensures that every non-null foreign key value must reference an existing primary key value in another tabl...
If an algorithm takes $5n²  + 3n + 10$ steps for an input of size n, its Big O notation would be:
Which OOP principle allows for restricting access to certain parts of an object while exposing only necessary parts for interaction?
Which algorithm is used for computing Max-Flow in a network?