Bissoy.com
Doctors Medicines MCQs Q&A

Three-person P, Q, and R are standing in a queue. There are 7 persons between P and Q and 12 persons between Q and R. If there are only 5 persons ahead of R and 21 behind P, then what could be the minimum number of persons in the queue?

Three-person P, Q, and R are standing in a queue. There are 7 persons between P and Q and 12 persons between Q and R. If there are only 5 persons ahead of R and 21 behind P, then what could be the minimum number of persons in the queue? Correct Answer 32

The only possible case is given below

[ alt="F1 T.D Pallavi 13-Nov-2019 D6" src="//storage.googleapis.com/tb-img/production/19/11/F1_T.D_Pallavi_13-Nov-2019_D6.png" style="width: 264px; height: 47px;">

The number of persons = 5 + 4 + 7 + 13 + 3 = 32;

Hence, the correct answer is 32

Related Questions

Below problem consists of four statements. Based on the first two statements, the third and fourth statements may be true or false. If the first two statements are true, then choose the correct option from the given alternatives for remaining statements. 1. In a queue, A is standing behind D who is standing behind Q. 2. B is standing behind A but ahead of S. 3. Only two persons are standing behind B. 4. A is standing between B and S.
Seven people P, Q, R, S, T, U and V are standing in a queue. The number of people standing in front of P and V is same as the number of people standing behind R and S respectively. Three people are standing between Q and U. Q is standing behind P, but ahead of T. Who is standing at the rear end of the queue?
Three persons A, B and C are standing in a queue. There are five persons between A and B and eight persons between B and C. If there be three persons ahead of C and 21 persons behind A, what could be the minimum number of persons in the queue?
Three persons A, B and C are standing in a queue not necessarily in the same order. There are 4 persons between A and B, and 7 persons between B and C. If there are 11 persons ahead of C and 13 behind A, what could be the minimum number of persons in the queue?
Six persons namely A, B, C, D, E and F are standing in a queue to get a train ticket in a railway station. A is standing between E and F. F is ahead of B and E is standing behind D. C is standing behind B. Due to closing time at the ticket counter, they will give tickets only to the first four persons. Who will not get the tickets?
Three persons A, B and C arc standing in a queue. The number of persons between A and B is 5 and eight persons between B and C. If the number of persons ahead of C is 3 and behind A is 21, then what will be the minimum number of persons in the queue?
Sparrow, Penguin, Owl, Lion and Kangaroo are standing in order of their heights (from left to right). Owl is standing at position lower than only one animal. Lion is standing at position ahead only one animal. Penguin is standing in the middle of the row but ahead Sparrow. How many animals are standing ahead Sparrow?
In an NCC parade of a school, seven students P, Q, R, S, T, U, and V are standing in a row. V is standing between P and T. One student is standing between U and P. There are two students standing between R and T who is standing at the left of P. S is standing at the immediate right of U. There are three students between R and Q. Who is standing third from the left end of the row?
A double-ended queue supports operations like adding and removing items from both the sides of the queue. They support four operations like addFront(adding item to top of the queue), addRear(adding item to the bottom of the queue), removeFront(removing item from the top of the queue) and removeRear(removing item from the bottom of the queue). You are given only stacks to implement this data structure. You can implement only push and pop operations. What’s the time complexity of performing addFront and addRear? (Assume ‘m’ to be the size of the stack and ‘n’ to be the number of elements)
A Double-ended queue supports operations such as adding and removing items from both the sides of the queue. They support four operations like addFront(adding item to top of the queue), addRear(adding item to the bottom of the queue), removeFront(removing item from the top of the queue) and removeRear(removing item from the bottom of the queue). You are given only stacks to implement this data structure. You can implement only push and pop operations. What are the total number of stacks required for this operation?(you can reuse the stack)