Computer Science · Data Structures
एक लीनियर कतार (Linear queue) को Front (F) = -1 और Rear (R) = -1 के साथ प्रारंभ किया जाता है। यदि निम्नलिखित संचालन क्रमबद्ध रूप से किए जाते हैं: Enqueue(A), Enqueue(B), Enqueue(C), Dequeue(), तो F और R के अंतिम मान क्या होंगे? (0-आधारित इंडेक्सिंग मानें जहाँ पहला Enqueue, F = R = 0 सेट करता है)।
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1F = 0, R = 3
- 2F = 1, R = 3
- 3F = 0, R = 2
- 4F = 1, R = 2✓
सही उत्तर देखें
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