Computer Science · Data Structures
A linear queue is initialized with Front (F) = -1 and Rear (R) = -1. If the following operations are performed in sequence: Enqueue(A), Enqueue(B), Enqueue(C), Dequeue(), what are the final values of F and R? (Assume 0-based indexing where the first Enqueue sets F = R = 0).
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1F = 1, R = 2✓
- 2F = 0, R = 2
- 3F = 1, R = 3
- 4F = 0, R = 3
Correct answer
F = 1, R = 2
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Data Structures MCQs →Want more practice questions on Data Structures?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures