Stack Operations MCQ

Test your knowledge with important Stack Operations MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Stack Operations MCQs at Bissoy

• If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, what is the order of removal?
  ক

  ABCD

  খ

  DCBA

  গ

  DCAB

  ঘ

  ABDC
• Assume that the operators +,-, X are left associative and ^ is right associative. The order of precedence (from highest to lowest) is ^, X, +, -. The postfix expression for the infix expression a + b X c – d ^ e ^ f is?
  ক

  abc X+ def ^^ –

  খ

  abc X+ de^f^ –

  গ

  ab+c Xd – e ^f^

  ঘ

  -+aXbc^ ^def
• The type of expression in which operator succeeds its operands is?
  ক

  Infix Expression

  খ

  Prefix Expression

  গ

  Postfix Expression

  ঘ

  Both Prefix and Postfix Expressions
• Which of the following is not an inherent application of stack?
  ক

  Reversing a string

  খ

  Evaluation of postfix expression

  গ

  Implementation of recursion

  ঘ

  Job scheduling
• Convert the following Infix expression to Postfix form using a stack. x + y * z + (p * q + r) * s, Follow usual precedence rule and assume that the expression is legal.
  ক

  xyz*+pq*r+s*+

  খ

  xyz*+pq*r+s+*

  গ

  xyz+*pq*r+s*+

  ঘ

  xyzp+**qr+s*+
• Convert the following infix expressions into its equivalent postfix expressions. (A + B ⋀D)/(E – F)+G
  ক

  (A B D ⋀ + E F – / G +)

  খ

  (A B D +⋀ E F – / G +)

  গ

  (A B D ⋀ + E F/- G +)

  ঘ

  (A B D E F + ⋀ / – G +)
• The result of evaluating the postfix expression 5, 4, 6, +, *, 4, 9, 3, /, +, * is?
  ক

  600

  খ

  350

  গ

  650

  ঘ

  588
• The prefix form of an infix expression (p + q) – (r * t) is?
  ক

  + pq – *rt

  খ

  – +pqr * t

  গ

  – +pq * rt

  ঘ

  – + * pqrt
• What is the result of the following operation? Top (Push (S, X))
  ক

  X

  খ

  X+S

  গ

  S

  ঘ

  XS
• The postfix form of A*B+C/D is?
  ক

  *AB/CD+

  খ

  AB*CD/+

  গ

  A*BC+/D

  ঘ

  ABCD+/*
• The process of accessing data stored in a serial access memory is similar to manipulating data on a ________
  ক

  Heap

  খ

  Binary Tree

  গ

  Array

  ঘ

  Stack
• What data structure would you most likely see in non recursive implementation of a recursive algorithm?
  ক

  Linked List

  খ

  Stack

  গ

  Queue

  ঘ

  Tree
• The postfix form of the expression (A+ B)*(C*D- E)*F / G is?
  ক

  AB+ CD*E – FG /**

  খ

  AB + CD* E – F **G /

  গ

  AB + CD* E – *F *G /

  ঘ

  AB + CDE * – * F *G /