---
type: "Chapter"
knowledge_type: "chapter"
entity_type: "chapter"
id: "66def9a93f8b4e9e69bdbda3"
title: "Queue"
slug: "queue"
chapter_number_in_book: "4"
difficulty_level: ""
board: "CBSE"
curriculum: "CBSE"
class: "Class 12"
subject: "Computer Science"
book: "Computer Science"
canonical_url: "https://www.edzy.ai/cbse-class-12-computer-science-queue"
markdown_url: "https://www.edzy.ai/okf/chapter/cbse-class-12-computer-science-queue.md"
source_type: "examSubjectBookChapter"
source_id: "66def9a93f8b4e9e69bdbda3"
source: "Edzy"
source_pdf: "https://edzy-ai.s3.ap-south-1.amazonaws.com/edzy-express-ts/c388ee57-4f3d-4815-a0df-be88288667cd.pdf"
book_page_start: "59"
book_page_end: "67"
book_page_count: "9"
starts_on_page: "59"
ends_on_page: "67"
version: "1"
last_updated: "2026-06-25"
svg_icon: "https://edzy-ai.s3.ap-south-1.amazonaws.com/academic/class-12/66def9a93f8b4e9e69bdbda3.svg"
book_svg_icon: "https://edzy-ai.s3.ap-south-1.amazonaws.com/academic/class-12/66ae541b191fdf5766655c69.svg"
subject_svg_icon: "https://edzy-ai.s3.ap-south-1.amazonaws.com/edzy-express-ts/cfeb25f7-bc45-4041-8ea0-643d899472dd.svg"
color_name: "Deep Teal"
color_light_foreground: "#016B61"
color_light_background: "#DAFFFB"
color_dark_foreground: "#016B61"
color_dark_background: "#0B3934"
---

# Queue

Queue is chapter 4 in Computer Science, a CBSE Class 12 book for the subject Computer Science on Edzy.

## Knowledge Snapshot

| Field | Details |
| :--- | :--- |
| Board | CBSE |
| Curriculum | CBSE |
| Class | Class 12 |
| Subject | Computer Science |
| Book | Computer Science |
| Chapter | Queue |
| Chapter Number In Book | 4 |
| Chapter Slug | queue |
| Pages | 59-67 |
| Page Count | 9 |
| Source PDF | https://edzy-ai.s3.ap-south-1.amazonaws.com/edzy-express-ts/c388ee57-4f3d-4815-a0df-be88288667cd.pdf |
| Last Updated | 2026-06-25 |

## Chapter Overview

This chapter introduces the data structure known as Queue, which operates on the First-In-First-Out (FIFO) principle. It explains the significance of queues through real-life examples and discusses various operations, including enqueue and dequeue, in addition to practical implementations using Python.

## Topic Inventory

| No. | Topic ID | Topic |
| :--- | :--- | :--- |
| 1 | 69aa778ea243cecf9626e5cc | IntroductIon to Queue |
| 2 | 69aa778ea243cecf9626e5ce | operatIons on Queue |
| 3 | 69aa778ea243cecf9626e5d0 | ImplementatIon of Queue usIng python |
| 4 | 69aa778ea243cecf9626e5d2 | IntroductIon to deQue |
| 5 | 69aa778ea243cecf9626e5d4 | ImplementatIon of deQue usIng python |

## Topic-Wise Extracted Content

### IntroductIon to Queue

Queue is an ordered linear list of elements, having different ends for adding and removing elements in it. It works on the First-In-First-Out (FIFO) principle, meaning that the element that enters the queue first will come out first. Examples of queues in everyday life include students standing in a queue for morning assembly and customers forming a queue at the cash counter in a bank.

### operatIons on Queue

Following the FIFO approach, the queue supports the following operations:
- **ENQUEUE**: Inserts a new element at the rear end of the queue.
- **DEQUEUE**: Removes one element from the front of the queue.
- **IS EMPTY**: Checks if the queue has any elements.
- **PEEK**: Views the front element without removing it.
- **IS FULL**: Checks if more elements can be added to the queue.

### ImplementatIon of Queue usIng python

In Python, queues can be implemented using a list. Functions include:
- `enqueue(myQueue, element)`: Inserts a new element.
- `dequeue(myQueue)`: Removes the front element.
- `isEmpty(myQueue)`: Checks if the queue is empty.
- `size(myQueue)`: Returns the number of elements in the queue.

### IntroductIon to deQue

Deque, short for Double-ended queue, allows addition and removal of elements from both ends. This structure can function like both a stack and a queue.

### ImplementatIon of deQue usIng python

Deque can also be implemented using lists in Python with operations like `insertFront(myDeque, element)`, `deletionFront(myDeque)`, and `getFront(myDeque)` to manage elements from both ends.

## Chapter Summary

The chapter covers the definition and applications of queues, the operations supported by queues such as enqueue and dequeue, and practical implementations of both queue and deque using Python.

## Key Ideas

- Queues operate on FIFO principle.
- Enqueue adds elements at the rear, and Dequeue removes them from the front.
- Deque provides flexibility for operations at both ends.

## Important Chapter Facts

- The chapter is Queue.
- The chapter number in the book is 4.
- The subject is Computer Science.
- The book is Computer Science.
- The class is Class 12.
- The source PDF is https://edzy-ai.s3.ap-south-1.amazonaws.com/edzy-express-ts/c388ee57-4f3d-4815-a0df-be88288667cd.pdf.
- The chapter covers pages 59-67.
- The chapter page count is 9.

## Related OKF Entities

| Entity Type | Title | URL |
| :--- | :--- | :--- |
| Chapter Canonical Page | Queue | https://www.edzy.ai/cbse-class-12-computer-science-queue |
| Chapter Markdown | Queue | https://www.edzy.ai/okf/chapter/cbse-class-12-computer-science-queue.md |
| Source PDF | Queue | https://edzy-ai.s3.ap-south-1.amazonaws.com/edzy-express-ts/c388ee57-4f3d-4815-a0df-be88288667cd.pdf |

## Source Attribution

| Field | Value |
| :--- | :--- |
| Source | Edzy |
| Reference Type | examSubjectBookChapter |
| Reference ID | 66def9a93f8b4e9e69bdbda3 |
| Chapter ID | 66def9a93f8b4e9e69bdbda3 |
| Canonical URL | https://www.edzy.ai/cbse-class-12-computer-science-queue |
| Markdown URL | https://www.edzy.ai/okf/chapter/cbse-class-12-computer-science-queue.md |
| Source PDF | https://edzy-ai.s3.ap-south-1.amazonaws.com/edzy-express-ts/c388ee57-4f3d-4815-a0df-be88288667cd.pdf |
| Last Updated | 2026-06-25 |