Class 12 Computer Science: Stack and Queue Fundamentals
Answer the questions and tap Submit to see your score. Your progress is auto-saved on this device.
Jump to question
Q1 · MCQ · 1 mark
Which of the following data structures is typically used to implement recursion?
Q2 · MCQ · 1 mark
The principle on which a Stack operates is:
Q3 · MCQ · 1 mark
Which operation is used to add an element to the rear of a queue?
Q4 · MCQ · 1 mark
What happens if you try to pop an element from an empty stack?
Q5 · MCQ · 1 mark
In a circular queue, if `FRONT` and `REAR` point to the same location, it indicates that the queue is:
Q6 · FILL · 1 mark
A queue is a linear data structure that follows the principle of ____.
Q7 · FILL · 1 mark
The operation to remove an element from a stack is called ____.
Q8 · FILL · 1 mark
In a queue, elements are added at one end called the ____ and removed from the other end called the ____.
Q9 · SHORT · 2 marks
Briefly explain one real-world application of a Stack.
Q10 · SHORT · 2 marks
Differentiate between a linear queue and a circular queue in terms of memory utilization.