- {`void fun(int n)
-{
- Stack S; // Say it creates an empty stack S
- while (n > 0)
- {
- push(&S, n%2);
- n = n/2;
- }
-
- while (!isEmpty(&S))
- printf("%d ", pop(&S));
-}`}
-
- What does the above function do in general?
-
- ),
- options: [
- "A) Prints binary representation of n in reverse order",
- "B) Prints binary representation of n",
- "C) Prints the value of Logn",
- "D) Prints the value of Logn in reverse order",
- ],
- answer: "A) Prints binary representation of n in reverse order",
- },
- {
- question: (
- <>
- Consider the following pseudocode that uses a stack:
-
- {`declare a stack of characters
-while (there are more characters in the word to read)
-{
- read a character
- push the character on the stack
-}
-while (the stack is not empty)
-{
- pop a character off the stack
- write the character to the screen
-}`}
-
- What is output for input "geeksquiz"?
-
- ),
- options: [
- "A) geeksquizgeeksquiz",
- "B) ziuqskeeg",
- "C) geeksquiz",
- "D) ziuqskeegziuqskeeg",
- ],
- answer: "B) ziuqskeeg",
- },
- {
- question: (
- <>
- Following is an incorrect pseudocode for the algorithm which is supposed to determine whether a sequence of parentheses is balanced:
-
- {`declare a character stack
-while (more input is available)
-{
- read a character
- if (the character is a '(' )
- push it on the stack
- else if (the character is a ')' and the stack is not empty)
- pop a character off the stack
- else
- print "unbalanced" and exit
-}
-print "balanced"`}
-
- Which of these unbalanced sequences does the above code think is balanced?
-
- ),
- options: [
- "A) ((())",
- "B) ())(()",
- "C) (()())",
- "D) (()))()",
- ],
- answer: "D) (()))()",
- },
- // Average Questions
- {
- question: (
- <>
- The following postfix expression with single digit operands is evaluated using a stack:
-
- {`8 2 3 ^ / 2 3 * + 5 1 * -`}
-
- The top two elements of the stack after the first * is evaluated are:
-
- ),
- options: [
- "A) 6, 1",
- "B) 5, 7",
- "C) 3, 2",
- "D) 1, 5",
- ],
- answer: "A) 6, 1",
- },
- {
- question: (
- <>
- A single array A[1..MAXSIZE] is used to implement two stacks. The two stacks grow from opposite ends of the array. If the space is to be used efficiently, the condition for “stack full” is:
-
- ),
- options: [
- "A) (top1 = MAXSIZE/2) and (top2 = MAXSIZE/2+1)",
- "B) top1 + top2 + 1 = MAXSIZE",
- "C) (top1= MAXSIZE/2) or (top2 = MAXSIZE)",
- "D) top1= top2 -1",
- ],
- answer: "B) top1 + top2 + 1 = MAXSIZE",
- },
- {
- question: (
- <>
- Assume that the operators +, -, × are left associative and ^ is right associative. The order of precedence (from highest to lowest) is ^, x , +, -. The postfix expression corresponding to the infix expression a + b × c - d ^ e ^ f is
-
- ),
- options: [
- "A) abc × + def ^ ^ -",
- "B) abc × + de ^ f ^ -",
- "C) ab + c × d - e ^ f ^",
- "D) - + a × bc ^ ^ def",
- ],
- answer: "A) abc × + def ^ ^ -",
- },
- // Difficult Questions
- {
- question: (
- <>
- The result evaluating the postfix expression 10 5 + 60 6 / * 8 – is
-
- ),
- options: [
- "A) 284",
- "B) 213",
- "C) 142",
- "D) 71",
- ],
- answer: "C) 142", // Removed answer
- },
- {
- question: (
- <>
- A function f defined on stacks of integers satisfies the following properties. f(∅) = 0 and f(push(S, i)) = max(f(S), 0) + i for all stacks S and integers i.
- If a stack S contains the integers 2, -3, 2, -1, 2 in order from bottom to top, what is f(S)?
-
- ),
- options: [
- "A) 6",
- "B) 4",
- "C) 3",
- "D) 2",
- ],
- answer: "A) 6",
- },
- {
- question: (
- <>
- A priority queue Q is used to implement a stack S that stores characters. PUSH(C) is implemented as INSERT(Q, C, K) where K is an appropriate integer key chosen by the implementation. For a sequence of operations, the keys chosen are in
-
- ),
- options: [
- "A) Non-increasing order",
- "B) Non-decreasing order",
- "C) strictly increasing order",
- "D) strictly decreasing order",
- ],
- answer: "C) strictly increasing order",
- },
- {
- question: (
- <>
- If the sequence of operations - push (1), push (2), pop, push (1), push (2), pop, pop, pop, push (2), pop are performed on a stack, the sequence of popped out values
-
- ),
- options: [
- "A) 2,2,1,1,2",
- "B) 2,2,1,2,2",
- "C) 2,1,2,2,1",
- "D) 2,1,2,2,2",
- ],
- answer: "C) 2,1,2,2,1",
- },
- ];
-
- const [currentQuestion, setCurrentQuestion] = useState(0);
- const [score, setScore] = useState(0);
- const [showResult, setShowResult] = useState(false);
- const [selectedOption, setSelectedOption] = useState- {score <= 5 ? "Better luck next time!" : score <= 8 ? "Good job!" : "Excellent work!"} -
-