Skip to main content
Super TutorResources
Chapter 4 of 13
QuestionsNotesFlashcardsSummaryFormulasQuizConceptsSyllabusPlan
NCERT Solutions

Queue

CBSE · Class 12 · Computer Science

NCERT Solutions for Queue — CBSE Class 12 Computer Science.

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 ncert solutions 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
14 Questions Solved · 1 Section

7 worked solutions below. Unlock all 14 free in Super Tutor

EXERCISE

1(a)____________ is a linear list of elements in which insertion and deletion takes place from different ends.Show solution
A queue is a linear list of elements in which insertion and deletion take place from different ends.

Not sure why a step works? check your working in Super Tutor

1(b)Operations on a queue are performed in ____________ order.Show solution
Operations on a queue are performed in FIFO (First In First Out) order.

Not sure why a step works? check your working in Super Tutor

1(c)Insertion operation in a queue is called ____________ and deletion operation in a queue is called ____________.Show solution
The insertion operation in a queue is called enqueue and the deletion operation is called dequeue.

Not sure why a step works? check your working in Super Tutor

1(d)Deletion of elements is performed from ____________ end of the queue.Show solution
Deletion of elements is performed from the front end of the queue.

Not sure why a step works? check your working in Super Tutor

1(e)Elements 'A', 'S', 'D' and 'F' are present in the queue, and they are deleted one at a time, ____________ is the sequence of element received.Show solution
A queue follows FIFO, so elements are deleted in the same order in which they were inserted: A, S, D, F.

Not sure why a step works? check your working in Super Tutor

1(f)____________ is a data structure where elements can be added or removed at either end, but not in the middle.Show solution
A deque is a data structure where elements can be added or removed at either end, but not in the middle.

Not sure why a step works? check your working in Super Tutor

1(g)A deque contains 'z', 'x', 'c', 'v' and 'b'. Elements received after deletion are 'z', 'b', 'v', 'x' and 'c'. ____________ is the sequence of deletion operation performed on deque.Show solution
Since the received elements are z, b, v, x, c, the deletions must have been done by removing from both ends of the deque alternatively.

Not sure why a step works? check your working in Super Tutor

2Compare and contrast queue with stack.
3How does FIFO describe queue?
4Write a menu driven python program using queue, to implement movement of shuttlecock in it's box.
5How is queue data type different from deque data type?
6Show the status of queue after each operation
enqueue(34)
enqueue(54)
dequeue()
enqueue(12)
dequeue()
enqueue(61)
peek()
dequeue()
dequeue()
dequeue()
dequeue()
enqueue(1)
7Show the status of deque after each operation
peek()
insertFront(12)
insertRear(67)
deletionFront()
insertRear(43)
deletionRear()
deletionFront()
deletionRear()
8Write a python program to check whether the given string is palindrome or not, using deque. (Hint : refer to algorithm 4.1)

7 more solved questions in Queue

Every remaining exercise is solved step by step in Super Tutor, plus practice quizzes and flashcards for this chapter. Free to start.

Stuck on a step?

Ask Super Tutor AI to explain any solution on this page in a simpler way — free, 24x7.

Ask a Doubt Free

Frequently Asked Questions

What are the important topics in Queue for CBSE Class 12 Computer Science?
Queue covers several key topics that are frequently asked in CBSE 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 — CBSE 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.
Where can I get free NCERT Solutions for Queue Class 12 Computer Science?
This page has free step-by-step NCERT Solutions for every exercise question in Queue (CBSE Class 12 Computer Science) — written the way examiners award marks: given, formula, working, answer.

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 — CBSE Class 12 Computer Science NCERT Solutions

For serious students

Get the full Queue chapter — for free.

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

Try Super Tutor Free
Try the full chapter — Free