Data Structures: Stack and Queues || Fill in the Blanks || Class 12

Data Structures: Stack and Queues || Fill in the Blanks || Class 12

1. _____ means organization of data.

2. A data structure has well defined _____ and _____.

3. A _____ is a linear list, also known as LIFO list.

4. A _____ is a linear list, also known as FIFO list.

5. A _____ is a mutable sequence of data elements indexed by their position.

6. _____ means accessing or visiting or processing each element of any data structure.

7. _____ is the term coined for insertion of elements in a stack list.

8. Consider the following code:

push(5)
push(8)
pop
push(2)
push(5)
pop
pop
pop
push(1)
pop

The output of the above snippet is _____.

9. In the stack, if a user tries to remove an element from the empty stack, then it called _____.

10. If the elements "A", "B", "C" and "D" are placed in a queue and are deleted one at a time, the order in which they will be removed will be _____.

11. A stack is a linear structure implemented in LIFO (_____ _____ _____ _____) manner.

12. The technical terms for insertion-in-a-stack and deletion-from-stack are _____ and _____ respectively.

13. A queue is a linear structure implemented in FIFO (_____ _____ _____ _____) manner.

14. The Enqueue operation adds item at the _____ end of the queue.

15. The Dequeue operation removes the item from the _____ end of the queue.

16. Adding an element in a queue is called _____ operation.

17. _____ refers to a situation (ERROR) when one tries to enqueue/insert an item in a queue that is full.

18. _____ refers to a situation (ERROR) when one tries to dequeue/delete an item from an empty queue.

19. To use the empty space in the front of a linear queue implementation, _____ queue variation is used.

20. The __________ is a deque that allows deletions at one end only, but allows insertions at both ends.


Answers:

1. Data structure
2. operations, behavior
3. stack
4. queue
5. list
6. Traversing
7. push
8. 85251
9. Underflow of stack
10. ABCD
11. Last In First Out
12. Push, Pop
13. First In First Out
14. rear
15. front
16. enqueue
17. Overflow
18. Underflow
19. circular
20. output restricted deque