MIDTERM EXAM - DSA - C

Which of the following data structures works on the principle of Last In, First Out (LIFO)?

• Queue

• Stack

• Linked List

• Tree

Which operation is used to remove an element from the stack?

• Pop

• Push

• Peek

• Delete

Which operation returns the top element of a stack without removing it?

• Pop

• Peek

• Push

• Display

What happens when you try to pop an element from an empty stack?

• Stack Overflow

• Stack Underflow

• Null Exception

• Invalid Operation

Which of the following can be used to implement a stack?

• Arrays

• Linked Lists

• Both A and B

• Queues

What will be the content of the stack after performing: push(1), push(2), push(3), pop(), push(4)?

• 1, 2, 3

• 1, 2, 4

• 1, 3, 4

• 2, 3, 4

Which application uses stacks?

• Recursion

• Expression evaluation

• Undo/Redo feature in editors

• All of the above

The process of reversing a string using stack involves:

• Inserting all characters then removing them

• Sorting characters alphabetically

• Using recursion only

• Using queue to reverse

In a stack implemented using an array of size 5, what is the condition for overflow?

• top == -1

• top == 0

• top == size - 1

• top == size

Consider the following code:
Stack S;

push(S, 10);

push(S, 20);

push(S, 30);

pop(S);

push(S, 40);

What will be on top of the stack?

• 10

• 20

• 30

• 40