Understanding Stacks: A Quiz for Grade 12 Students

What is the main characteristic of a stack data structure?

• First in, first out (FIFO)

• Last in, first out (LIFO)

• Random access

• Circular access

Which operation adds an element to the top of a stack?

• pop()

• is_empty()

• peek()

• push(data)

What does the pop() operation do in a stack?

• Checks whether a stack is empty

• Adds an element to the top of the stack

• Returns a copy of the element on the top of the stack

• Removes an element from the top of the stack

Which operation checks if a stack is empty?

• is_empty()

• push(data)

• is_full()

• peek()

What is the purpose of the peek() operation?

• To check if the stack is full

• To add an element to the stack

• To return a copy of the top element without removing it

• To remove the top element of the stack

In a stack, which element is removed first?

• The last element added

• The first element added

• The smallest element

• The middle element

What real-life example is used to describe a stack?

• A bookshelf

• A line of cars

• A stack of plates

• A queue of people

What does the is_full() operation check in a stack?

• If the stack has a specific element

• If the stack is at maximum capacity

• If the stack is sorted

• If the stack is empty

What must be maintained to implement a stack?

• A pointer to the bottom of the stack

• A pointer to the middle of the stack

• A pointer to the top of the stack

• A pointer to the largest element

Which of the following is NOT a main stack operation?

• peek()

• push(data)

• pop()

• enqueue()