GATE CS 2017 Set 2 — Question 13
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.MCQ+1 / -0.33EasySingly Linked ListsLinked ListsProgramming & Data StructuresQueue & Circular QueueStacks & Queues
Programming & Data Structures → Linked Lists → Queue & Circular Queue
Last updated
Question
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 rear 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 TIME?I. Next pointer of front node points to the rear node.
II. Next pointer of rear node points to the front node.
II. Next pointer of rear node points to the front node.
Correct answer
(B) II only
Solution
In a circular queue implemented using a singly linked list:
1.Deletion is performed at the FRONT. Since we have a direct pointer to the front node, we can access it and update FRONT to
FRONT->next in time.2.Insertion is performed at the REAR. To insert a new node in time, we need to update the
next pointer of the current rear node to point to the new node and then update the REAR pointer. 3.For the queue to be circular, the
Statement I is incorrect because the front node's next pointer of the last node (rear) must point back to the first node (front). This is exactly what Statement II describes.next pointer should point to the second node in the queue, not necessarily the rear node (unless there are only two nodes). Therefore, only Statement II is correct for maintaining the circular property and allowing operations.Continue learning with Success Tracker
A step still unclear? Work through it with support
Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.
AI-powered practice· Unlimited practice on eligible plans
- PYQs with solutions
- Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
- Practice that adapts
- Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
- AI doubt support
- Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.
Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.
This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.
More questions on Linked Lists
2026 Set 2 Q12The set T represents various traversals over binary tree. The set S represents the order of…2026 Set 2 Q19Consider the following three ANSI-C programs, P1, P2, and P3. P1 [code] P2 [code] **P3**…2026 Set 1 Q23Let be an odd number greater than 100. Consider a binary minheap with elements stored in an…2026 Set 1 Q24Consider a hash table that is initially empty. The hash table is maintained…2026 Set 1 Q27Consider the following C statements: Which of the following options is/are correct? [figure]