MIDTERM EXAM - DSA - C

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

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

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

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

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

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

Which application uses stacks?

The process of reversing a string using stack involves:

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

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?