A stack of capacity 5 is empty. After push(1), push(2), push(3), pop(), push(4), pop(), pop(), what is left on the stack?

Name three applications of a stack.

Write the algorithm for the push operation on a stack implemented in an array of capacity n.

What is a stack? Name the two operations on it and state what overflow and underflow mean.

Write a recursive Java method to compute the factorial of a non-negative integer n.

State and verify the absorption law X + X·Y = X using a truth table.

Convert the Boolean expression F(A, B, C) = Σ(1, 3, 5) into its canonical sum of products form.