MCQs on Stacks and Queues

A stack is also called as:

• FIFO list

• LIFO list

• Random access list

• Priority list

Which of the following is not an application of stack?

• Expression evaluation

• Function call management

• Round Robin Scheduling

• Infix to Postfix conversion

Which operation is used to insert an element into a stack?

• Push

• Pop

• Enqueue

• Dequeue

Which operation is used to remove the top element from a stack?

• Push

• Pop

• Peek

• Insert

The array representation of stack requires maintaining a variable called:

• Head

• Tail

• Front

• Top

The time complexity of Push and Pop operations on a stack is:

• O(1)

• O(n)

• O(log n)

• O(n log n)

Infix expression: (A + B) * (C - D) converted to postfix is:

• AB+CD-*

• AB+*CD-

• ABCD+-*

• A+B*C-D

Which data structure is used in function call management (recursion)?

• Queue

• Stack

• Tree

• Graph

Which of the following symbols has highest precedence in infix expressions?

• +

• *

• -

• (

The postfix expression 6 2 3 + - 3 8 2 / + * 2 ^ 3 + evaluates to:

• 17

• 20

• 23

• 26