Skip to main content
Super TutorResources
Chapter 4 of 13
QuestionsNotesFlashcardsSummaryFormulasQuizConceptsSyllabusPlan
Revision Notes

Queue

Jharkhand Board · Class 12 · Computer Science

Quick revision notes for Queue — Jharkhand Board Class 12 Computer Science. Key concepts, formulas, and definitions for last-minute revision.

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 revision notes 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

Key Topics to Revise

1

1. Core Idea of Queue

  • Queue is an ordered linear list of elements with different ends for adding and removing elements.
  • Queue follows the First-In-First-Out principle, also called First Come First Served.
  • The element that enters first leaves first.
2

2. Operations on Queue

  • ENQUEUE inserts a new element at the rear end of the queue.
  • DEQUEUE removes one element at a time from the front end of the queue.
  • IS EMPTY checks whether the queue has elements or not.
3

3. Queue Implementation in Python

  • myQueue is created as an empty list.
  • enqueue() uses append() to insert an element at the end of the list.
  • isEmpty() checks whether len(myQueue) is equal to zero.
4

4. Deque and Its Operations

  • Deque is a double-ended queue.
  • Addition and removal can happen from both ends: front or rear.
  • Deque can be used to implement a stack or a queue.

Get complete notes with diagrams and examples

Full Notes

Key Concepts

Queue is an ordered linear listFront is the end fromEnqueue is the insertion operationDequeue is the deletion operationOverflow happens when insertion is attempted

Frequently Asked Questions

What are the important topics in Queue for Jharkhand Board Class 12 Computer Science?
Queue covers several key topics that are frequently asked in Jharkhand 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 — Jharkhand 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 — Jharkhand Board Class 12 Computer Science Revision Notes

For serious students

Get the full Queue chapter — for free.

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

Try Super Tutor Free
Try the full chapter — Free