Class 12 Computer Science: Stack and Queue Fundamentals

This worksheet assesses your understanding of fundamental concepts related to Data Structures such as Stack and Queue, including their operations and applications.

Class 12CBSEComputer SciencemediumPractice

Open print view With answer key Report an issue

Preview · 10 questions

Q1. Which of the following data structures is typically used to implement recursion?
- Queue
- Stack
- Linked List
- Tree
Q2. The principle on which a Stack operates is:
- First In, First Out (FIFO)
- Last In, Last Out (LILO)
- First In, Last Out (FILO)
- Last In, First Out (LIFO)
Q3. Which operation is used to add an element to the rear of a queue?
- Pop
- Push
- Dequeue
- Enqueue
Q4. What happens if you try to pop an element from an empty stack?
- Program terminates
- Stack overflow occurs
- Stack underflow occurs
- An exception is always ignored
Q5. In a circular queue, if `FRONT` and `REAR` point to the same location, it indicates that the queue is:
- Empty
- Full
- Has only one element
- Cannot determine

+ 5 more in the printable PDF.