Bissoy.com
Doctors Medicines MCQs Q&A

Consider a standard circular queue ‘q’ implementation (which has same condition for queue full and queue empty) whose size is 11 and the elements of the queue are q[0], q[1], .... q[10]. The front and rear pointers are initialized to point at q[2]. In which position will the ninth element be added ?

Consider a standard circular queue ‘q’ implementation (which has same condition for queue full and queue empty) whose size is 11 and the elements of the queue are q[0], q[1], .... q[10]. The front and rear pointers are initialized to point at q[2]. In which position will the ninth element be added ? Correct Answer q[0]

The correct answer is “option 1”.

KEY POINTS:

A Queue is a data structure based on the FIFO rule.

Insertion & deletion is done from the REAR & FRONT pointer respectively.

A circular queue is a queue whose last element is connected back to the first element.

Insertion operation in the queue is known as En-queue.

Deletion operation in the queue is known as De-queue.

IMPORTANT point:

The en-queue operation first increments the REAR pointer & then insert the element.

The de-queue operation first increments FRONT and then deletes the element.

EXPLANATION:

.

Therefore, the 9th element will get placed in q.

Hence, the correct answer is “option 1”.

Related Questions

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.
Consider the following two C code segment. Y and X are one- and two-dimensional arrays of size n and n × n respectively, where 2 ≤ n ≤ 10. Assume that in both code segments, elements of y are initialized to 0 and each element X[i] [j] of array X is initialized to i + j. Further assume that when stored in main memory all elements of x are in same main memory page frame. Code segment 1:                 //initialize elements of y to 0                 //initialize elements X[i] [j] of X to i+j                       for (i = 0; i < n; i++)                                 Y[i] += X[0] [i]; Code Segment 2:                 //initialize elements of Y to 0                 //initialize elements X[i] [j] of X to i+j                        for (i = 0; i < n; i++)                                 Y[i] += X[i] [0]; Which of the following statements is/are correct? S1: Final contents of array Y will be same in both code segments S2: Elements of array X accessed inside the for loop shown in code segment 1 are contiguous in main memory S3: Elements of array X accessed inside the for loop shown in code segment 2 are contiguous in main memory
In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into EMPTY queue?
In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into a NONEMPTY queue?
How far is point 'R' from Point 'T'? Statement (I): Point 'R' is 5 metres to the north of point 'M'. Point 'U' is 4 metres to the east of point 'R'. Point 'T' is to the west of point 'R' such that points 'U' 'R' and 'T' form a straight line of  metres. Statement (II): Point 'Z' is metres to the south of point 'T'. Point 'U' is  metres to the east of point 'T'. Point 'M' is  metres to the east of point 'Z'. Point 'R' is  metres to the north of point 'M'. Point 'R' lies on the line formed by joining points 'T' and 'U'.
Point A is 3m in the north of point B. Point D is 2m in the east of point E. Point F is 9m in the west of point G. Point C is 4m in the west of point B. Point C is 3m in the south of point D. Point F is 5m in the south of point E. Point H is 5m in the north of point G. What is the shortest distance between point H and point A?
Point P is 4m in the west of point V. Point R is 6m in the north of point Q. Point T is 5m in the south of point S. Point V is in the middle of point R and Q. Point U is 5m in the east of point R. Point V is in north of point Q. Point S is 5m in the east of point V. What is the area of triangle formed by point P, R and Q?
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)
Study the following information and answer the questions. Point A is 8m to the west of Point B. Point C is 4m to the south of Point B. Point D is 4m to the east of Point C. Point F is 6m to the north of Point D. Point E is 8m to the west of Point F. Point G is 2m to the south of Point E. How far and in which direction is Point G from Point A?
Study the following information and answer the questions. Point A is 8m to the west of Point B. Point C is 4m to the south of Point B. Point D is 4m to the east of Point C. Point F is 6m to the north of Point D. Point E is 8m to the west of Point F. Point G is 2m to the south of Point E. If point G is 4m to the north of Point H, then what is the distance between H and D?