Data Structures · Question 10 · Medium
Data Structures question 10
A circular queue is implemented in an array of size n using front and rear indices, keeping one slot always empty to tell full from empty. Which condition means the queue is full?
- rear == front
- rear == n - 1
- (front + 1) % n == rear
- (rear + 1) % n == front
Answer and explanation
Answer: D. (rear + 1) % n == front
Explanation: With one slot kept empty, the queue is full when advancing rear by one (with wrap-around) would make it equal to front. rear == front is the empty condition.
Previous: What is the value of the postfix expression 6 2 3 + - 3 8 2 / + * ? · Next: Keys 15, 22, 8 and 29 are inserted in that order into an empty hash table of…
Practise data structures
Try a fresh set of data structures questions with an explanation after every answer, free and without signing up: Data Structures practice. Or sit a full placement mock test.
More data structures questions
- What is the postfix form of the infix expression A + B * C - D ?
- A binary tree has height 4, where height is the number of edges on the longest…
- What is the value of the postfix expression 6 2 3 + - 3 8 2 / + * ?
- Keys 15, 22, 8 and 29 are inserted in that order into an empty hash table of…
- The preorder traversal of a Binary Search Tree is 50, 30, 20, 40, 70, 60, 80…
- The keys 10, 4, 7, 1 are inserted in that order into an empty array-based…
- How many structurally different binary trees can be formed with exactly 3 nodes?
- Two stacks share a single array arr[0..n-1]. Stack 1 starts at index 0 and…
- Which data structure is the most natural choice for implementing the Undo…
- What is the time complexity of inserting a new node at the beginning (head) of…
More technical & programming practice
Algorithms · Object-Oriented Programming · DBMS · SQL · Operating Systems · Computer Networks · Software Engineering · Cloud & DevOps
LogicWiz Exams home · All practice topics · Placement mock tests · Daily 10 challenge