BCA_DS

What is the primary characteristic of a stack in computer science?

• It follows a First In, First Out (FIFO) order.
• It can only store integers.
• It allows random access to elements.
• It follows a Last In, First Out (LIFO) order.

In a stack, what happens to the last item added when an item is removed?

• It remains in the stack until the stack is empty.
• It is ignored by the stack.
• It is moved to the bottom of the stack.
• It becomes the first item to be removed.

Which of the following operations would you use to remove the top element from a stack?

• Pop
• Push
• isEmpty
• Peek

Which operation is used to add an element to the top of a stack?

• Pop
• Push
• Size
• Peek

What does the Size operation do in a stack?

• It returns the top element of the stack.
• It checks if the stack is empty.
• It returns the number of elements in the stack.
• It removes the last element added.

How can a stack be compared to a real-world object?

• Like a pile of clothes that can be sorted at any time.
• Like a box of assorted items that can be accessed from any side.
• Like a stack of plates where the top plate is the first to be taken.
• Like a line of people waiting for a bus.

In a stack implemented using an array, what variable indicates the index of the top element?

• base
• top
• index
• count

Which of the following statements is true regarding stacks?

• Stacks do not support the Peek operation.
• Stacks allow access to any element at any time.
• Stacks can only be implemented using arrays.
• Stacks can be implemented using arrays or linked lists.

When a function is called in programming, what happens to the current function in relation to the stack?

• It is placed at the bottom of the stack.
• It is ignored by the stack.
• It is removed from the stack.
• It is pushed onto the stack.

What is a common application of stacks in computer science?

• Image processing.
• Data sorting algorithms.
• Database indexing.
• Function call management.