Data Structures: Stack and Queues || True or False || Class 12

Data Structures: Stack and Queues || True or False || Class 12

1. Single-ended queue is a type of queue data structure.

2. Reversing a word/line is an application of stack.

3. The insertion and deletion from a stack takes place only from the 'TOP'.

4. A queue behaves on the basis of LIFO principle.

5. When a queue is implemented with the help of a list, it is termed as a linear queue.

6. CPU uses queues to implement round-robin scheduling among waiting processes.

7. Deletion of an element from the queue is termed as pop operation.

8. An element from a queue is added from the front end.

9. Handling the processes of a network printer is the most important application of queues.

10. The function append() automatically inserts an element at the rear end in a queue.

11. Push and Pop are terms related to stack data structure.

12. Enqueue and Dequeue are terms related to queue data structure.

13. The postfix conversion of an infix expression and recursion are internally implement through stacks.

14. The circular queue better utilises the space in a fixed size queue.

15. Pushing in a full fixed size stack results into an error.

16. Popping from an empty stack results into an error.

17. Inserting in a full fixed size queue results into an error.

18. Deleting from an empty queue results into an error.

19. For reversing the order of a list of values, queues are internally used.

20. Like circular and double-ended queues, implementation formats of stacks may also be varied.


Answer =

1. False
2. True
3. True
4. False
5. True
6. True
7. False
8. False
9. True
10. True
11. True
12. True
13. True
14. True
15. True
16. True
17. True
18. True
19. False
20. False