Stack and Queue MCQs Quiz Multiple Choice Questions & Answers

1. A queue data-structure can be used for

1. resource allocation
2. all of the above
3. expression parsing
4. recursion

2. What data structure is used for breadth first traversal of a graph?

1. list
2. none of the above
3. queue
4. stack

3. What will be the initial value with which top is initialized.

1. 1
2. -1
3. Garbage

4. At the end of last operation, total number of elements present in the stack are

1. 1
2. 3
3. 2

5. Minimum number of queues required for priority queue implementation?

1. 3
2. 2
3. 5
4. 4

6. Popping is an act of

1. Transferring values from stack
2. None of them
3. Adding values
4. Taking off values from stack

7. In linked representation of stack the null pointer of the last node in the list signals ……….

1. Middle of the stack
2. In between some value
3. Beginning of the stack
4. Bottom of the stack

8. Stack is used for

1. Recursion
2. None of the above
3. CPU Resource Allocation
4. Breadth First Traversal

9. In the stack, If user try to remove element from the empty stack then it called as

1. Garbage Collection
2. Overflow of Stack
3. Empty Collection
4. Underflow of Stack

10. Stack in Data Structure is

1. LILO
2. None of these
3. FIFO
4. LIFO

11. A queue is a ?

1. Ordered array
2. Linear tree
3. FIFO (First In First Out) list
4. LIFO (Last In First Out) list.

12. Which of the following is an application of stack?

1. infix to postfix
2. all of the above
3. finding factorial
4. tower of Hanoi

13. Which is the pointer associated with the stack?

1. TOP
2. REAR
3. FIRST
4. FRONT

14. New nodes are added to the ……… of the queue.

1. Middle
2. Both A and B
3. Front
4. Back

15. Deletion operation is done using ……… in a queue.

1. top
2. list
3. front
4. rear

16. In liked representation of stack ……. holds the elements of the stack.

1. LINK fields
2. NULL fields
3. INFO fields
4. TOP fields

17. User push 1 element in the stack having already five elements and having stack size as 5 then stack becomes

1. User Flow
2. Crash
3. Overflow
4. Underflow

18. Act of adding values into a stack is called

1. Pushing
2. None
3. Popping
4. Polling

19. push() and pop() functions are found in

1. stacks
2. trees
3. queues
4. lists

20. The elements are removal from a stack in ………. order.

1. Alternative
2. Sequential
3. Reverse
4. Hierarchical

21. Which of them is an abstract data structure (ADT)?

1. Functions
2. Both A and B
3. Stacks
4. Queues

22. In the linked representation of the stack ……… behaves as the top pointer variable of stack.

1. Start pointer
2. Avail pointer
3. Stop pointer
4. Begin pointer

23. What happens when you push a new node onto a stack?

1. The new node is placed at the middle of the linked list
2. No Changes happens
3. The new node is placed at the front of the linked list
4. The new node is placed at the back of the linked list

24. A pointer variable which contains the location at the top element of the stack is called …..

1. Final
2. End
3. Top
4. Last