Bissoy.com
Doctors Medicines MCQs Q&A

Five boys J, K, L, M and T are standing in a queue one after the other (not necessarily in the same order). There is only one boy between K and J. There is only one boy between K and L. There are four boys behind J. T is three places ahead of L. How many boys are ahead of M?

Five boys J, K, L, M and T are standing in a queue one after the other (not necessarily in the same order). There is only one boy between K and J. There is only one boy between K and L. There are four boys behind J. T is three places ahead of L. How many boys are ahead of M? Correct Answer 3

1) There are four boys behind J.

J

 

 

 

 

 

2) T is three places ahead of L.

3) There is only one boy between K and L.

4) There is only one boy between K and J.

J

T

K

 

L

 

5) SO, M stands on the remaining place.

J

T

K

M

L

 

SO, there are 3 boys standing above M.

Thus, the correct answer is “3”.

Related Questions

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?
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.
Five people – A, B, C, D and E are standing in a line, one after the other, not necessarily in the same order. A is not standing either at the first or last position in the line. C is standing after one person only. There is only one person standing behind D. B is not standing at the last. Who stands at the last in the line?
Seven students T, U, V, W, X, Y, and Z and standing in a queue but not necessarily in the same order. T is standing at 3rd position and U is at the first position in the queue. Three students stand between T and Z. Only X is standing between W and Z. Y is standing at one of the positions before T. What is the position of V from the last?
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?
Eight boys are sitting around a circular table and drinking milk in their own separate glasses with ID numbers 1 to 8. Boy-2 is sitting between boy-6 and boy-7, boy-1 is sitting between boy-8 and boy-5. Boy-3 is sitting to the third left of boy-7 and boy-8 is sitting to the third right of boy-4. What is the position of boy-5 with respect to boy-3 ?
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 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?
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)