Skip to main content
Super TutorResources
Chapter 4 of 13
QuestionsNotesFlashcardsSummaryFormulasQuizConceptsSyllabusPlan
Chapter Summary

Queue

Haryana Board · Class 12 · Computer Science

Summary of Queue for Haryana Board Class 12 Computer Science. Key concepts, important points, and chapter overview.

43 questions68 flashcards5 concepts

Interactive on Super Tutor

Studying Queue? Get the full interactive chapter.

Quizzes, flashcards, AI doubt-solver and a step-by-step study plan — built for chapter summary and more.

Try Super Tutor — Free

1,000+ Class 12 students started this chapter today

An illustration demonstrating the First-In, First-Out (FIFO) principle of a queue using a real-world analogy like people in a line. It should clearly show elements entering at one end (rear) and leavi
Super Tutor

This is just one of 6+ visuals inside Super Tutor's Queue chapter

Explore the full set

Overview

Queue is an ordered linear data structure in which insertion and deletion happen at different ends. It follows the First-In-First-Out principle, also called First Come First Served. The first item added to the queue is the first one removed. New items are added at the rear, also called the tail, and

Key Concepts

Queue is an ordered linear list

Queue is an ordered linear list of elements with different ends for adding and removing elements. It follows the FIFO strategy, so the element that en

Front is the end from

Front is the end from which elements are removed, and Rear is the end where new elements are added. Front is also called Head, and Rear is also called

Enqueue is the insertion operation

Enqueue is the insertion operation of a queue. A new element is added at the rear end.

Dequeue is the deletion operation

Dequeue is the deletion operation of a queue. One element is removed from the front end at a time.

Overflow happens when insertion is attempted

Overflow happens when insertion is attempted beyond the capacity of the queue. Underflow happens when deletion is attempted from an empty queue.

Learning Objectives

  • Understand the FIFO principle of queue
  • Identify front and rear ends of a queue
  • Learn queue operations such as enqueue, dequeue, isEmpty, peek, isFull, and size
  • Understand exceptions such as Overflow and Underflow
  • Study how a queue can be implemented using Python lists

Frequently Asked Questions

What are the important topics in Queue for Haryana Board Class 12 Computer Science?
Queue covers several key topics that are frequently asked in Haryana Board Class 12 board exams. Focus on the core concepts listed on this page and practise related questions to build confidence.
How to score full marks in Queue — Haryana Board Class 12 Computer Science?
Understand the core concepts first, then work through the 43 practice questions available for this chapter. Revise formulas and definitions regularly, and use flashcards for quick recall before the exam.

Sources & Official References

Content is aligned to the official syllabus. Refer to the board website for the latest curriculum.

More resources for Queue

All 13 chapters — Haryana Board Class 12 Computer Science Chapter Summary

For serious students

Get the full Queue chapter — for free.

Quizzes, flashcards, AI doubt-solver and a step-by-step study plan for Haryana Board Class 12 Computer Science.

Try Super Tutor Free
Try the full chapter — Free