Advertisements
Online Mock Tests
Chapters
![NCERT solutions for Computer Science [English] Class 12 chapter 4 - Queue - Shaalaa.com](/images/computer-science-english-class-12_6:3cc34948e1364f88bfa74088b5693c7f.jpg "NCERT solutions for Computer Science [English] Class 12 chapter 4 - Queue")
Advertisements
Solutions for Chapter 4: Queue
Below listed, you can find solutions for Chapter 4 of CBSE NCERT for Computer Science [English] Class 12.
NCERT solutions for Computer Science [English] Class 12 4 Queue Exercise [Pages 65 - 66]
Fill in the blank
______ is a linear list of elements in which insertion and deletion takes place from different ends.
Operations on a queue are performed in ______ order.
Insertion operation in a queue is called ______ and deletion operation in a queue is called ______.
Deletion of elements is performed from ______ end of the queue.
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.
______ is a data structure where elements can be added or removed at either end, but not in the middle.
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.
Compare and contrast queue with stack.
How does FIFO describe queue?
Write a menu driven python program using queue, to implement movement of shuttlecock in it’s box.
How is queue data type different from deque data type?
Show the status of deque after each operation.
peek()
insertFront(12)
insertRear(67)
deletionFront()
insertRear(43)
deletionRear()
deletionFront()
deletionRear()
Write a python program to check whether the given string is palindrome or not, using deque. (Hint : refer to algorithm 4.1)
Show the status of queue after each operation.
enqueue(34)
enqueue(54)
dequeue()
enqueue(12)
dequeue()
enqueue(61)
peek()
dequeue()
dequeue()
dequeue()
dequeue()
enqueue(1)
Solutions for 4: Queue
NCERT solutions for Computer Science [English] Class 12 chapter 4 - Queue
Shaalaa.com has the CBSE Mathematics Computer Science [English] Class 12 CBSE solutions in a manner that help students grasp basic concepts better and faster. The detailed, step-by-step solutions will help you understand the concepts better and clarify any confusion. NCERT solutions for Mathematics Computer Science [English] Class 12 CBSE 4 (Queue) include all questions with answers and detailed explanations. This will clear students' doubts about questions and improve their application skills while preparing for board exams.
Further, we at Shaalaa.com provide such solutions so students can prepare for written exams. NCERT textbook solutions can be a core help for self-study and provide excellent self-help guidance for students.
Concepts covered in Computer Science [English] Class 12 chapter 4 Queue are Stack and Queue in Data Structure, Introduction to Deque, Implementation of Deque Using Python.
Using NCERT Computer Science [English] Class 12 solutions Queue exercise by students is an easy way to prepare for the exams, as they involve solutions arranged chapter-wise and also page-wise. The questions involved in NCERT Solutions are essential questions that can be asked in the final exam. Maximum CBSE Computer Science [English] Class 12 students prefer NCERT Textbook Solutions to score more in exams.
Get the free view of Chapter 4, Queue Computer Science [English] Class 12 additional questions for Mathematics Computer Science [English] Class 12 CBSE, and you can use Shaalaa.com to keep it handy for your exam preparation.
