Stacks and Queues (TextBook MCQs)

Which of the following is based on the principle of Last In First Out?

• Stack

• Queue

• Both

• None of These

Which of the following is based on the principle of First In First Out?

• Stack

• Queue

• Both

• None of these

Which of the following data structures is used for the conversion on Infix to postfix?

• Stack

• Queue

• Both

• None of these

Which of the following data structures is used in recursion?

• Stack

• Queue

• Both

• None of these

Which of the following data structures is used for reversing a string?

• Stack

• Queue

• Both

• None of these

Which of the following data structures is used in First Come First Serve Scheduling in CPU?

• Stack

• Queue

• Both

• None of these

Which of the following data structures is used for the conversion on Infix to postfix?

• Stack

• Queue

• Both

• None of these

Which of the following is the correct value of TOP if stack is empty?

• 0

• Max-1

• -1

• None of these

Which of the following is the correct value of TOP if stack is full?

• 0

• Max-1

• -1

• None of these

Which of the following conditions are met if queue is empty?

• Front = -1 and Rear = -1

• Rear = Max - 1

• Rear = Front

• None of these

Answer explanation

Front = Rear = -1 would mean queue is empty

Rear = Max - 1 would mean queue is full

Front = Rear qould mean there is only 1 item in the queue