Stacks and Queues Quiz

What is a stack?

• An Abstract Data Type (ADT) used in programming.

• A type of queue.

• A data structure that stores elements in a random order.

• A method for sorting data.

What does LIFO stand for?

• Last In First Out

• Last In First Over

• Last In First Order

• Last In First Option

What is the purpose of the push operation in a stack?

• To add an element to the top of the stack.

• To remove an element from the top of the stack.

• To check if the stack is empty.

• To create a new stack.

What is the purpose of the pop operation in a stack?

• To remove and return the top element of the stack.

• To add an element to the top of the stack.

• To check if the stack is full.

• To create a new stack.

What is the maximum size of the stack defined in the example?

• 100

• 50

• 200

• No limit

What is the first element of the linked list considered in stack implementation?

• The stack top.

• The stack bottom.

• The last element.

• The middle element.

What is the output of the pop operation if the stack is empty?

• Stack underflow

• Stack overflow

• Null

• 0

What is the main application of stacks?

• Page-visited history in a Web browser.

• Sorting data.

• Searching algorithms.

• Graph traversal.

What is the difference between infix and postfix notation?

• Infix has operators between operands, postfix has them before.

• Postfix has operators between operands, infix has them before.

• Both are the same.

• Infix is used for stacks, postfix is not.

What is the basic idea of a queue?

• A queue is open at both ends.

• A queue is only used for inserting data.

• A queue is a type of stack.

• A queue can only remove data from one end.