Bissoy.com
Doctors Medicines MCQs Q&A

In a queue, Balu is found 8th from the front end and Soumith is 14th from the back end if they interchange their positions now Balu is 21st from the front end. How many persons are there in between Balu and Soumith?

In a queue, Balu is found 8th from the front end and Soumith is 14th from the back end if they interchange their positions now Balu is 21st from the front end. How many persons are there in between Balu and Soumith? Correct Answer 12

1) Balu is 8th from the front end and Soumith is 14th from the back end

On combining the statements, we get,

(Front end is taken on the top and back end are taken on the bottom) 

2) Now, after interchanging their position

The number of persons in the queue is 21 + 13 = 34

Therefore, after interchanging the positions of Balu and Soumith, the people between them are 34 - (8 + 14) = 12;

Hence, the correct answer is 12.

Related Questions

In a queue, P stands 7th from the start and Q stands 14th from the end. They both interchange their positions and now, P is 14th from the start. How many members are there in the queue? 
A, B, C, D, E, F, G and H are sitting in a row facing north. There are exactly two persons sitting between D and E. A is sitting third from the left end. B, A, C and G are sitting in that order from left to right but no two of them are in adjacent positions. D, F and H are sitting from left to right in that order, but not necessarily in adjacent positions. If H and D interchange their positions and then D and E interchange their positions, who sits second to the right of A?
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)
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?
In a row of people, Raghav is standing at the 14th position from the extreme left end and Naresh is at the 16th position from the extreme right end. If they interchange their respective positions, Raghav now becomes 23rd from the extreme left end. What is the position of Naresh from the extreme right end after the interchange?
In a row, Riya and Mona occupy the 9th place from the back of the row and 10th place from the front end, respectively. If they interchange their positions, then Riya and Mona occupy 17th place from the back and 18th place from the front respectively. How many persons are there in the row?
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 circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly two external pointers FRONT and REAR pointing to the front node and the near node of the queue, respectively. Which of the following statements is/are CORRECT for such a circular queue, so that insertion and deletion operations can be performed in O(1) time? I. Next pointer of front node points to the rear node. II. Next pointer of rear node points to the front node.
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?