Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightStacks

Stacks MCQs

chevron_left Back Page 1/17 chevron_right Next
  • 1. In a Stack the command to access nth element from the top of the stacks will be
  • filter_dramaExplanation
    Answer is : A
    None.
  • 2. Consider the usual algorithm for determining whether a sequence of parentheses is balanced. What is the maximum number of parentheses that will appear on the stack AT ANY ONE TIME when the algorithm analyzes: (()(())(()))
  • filter_dramaExplanation
    Answer is : C
    None.
  • 3.
  • filter_dramaExplanation
    Answer is : A
    None.
  • 4. Stack is used for
  • filter_dramaExplanation
    Answer is : C
    None.
  • 5. push() and pop() functions are found in
  • filter_dramaExplanation
    Answer is : C
    None.
  • 6. If locality is a concern, you can use _______ to traverse the graph.
  • filter_dramaExplanation
    Answer is : B
    None.
  • 7. Aposterior analysis are more accurate than apriori analysis because ?
  • filter_dramaExplanation
    Answer is : B
    None.
  • 8. Prefix notation is also known as
  • filter_dramaExplanation
    Answer is : D
    None.
  • 9. In conversion from prefix to postfix using stack data-structure, if operators and operands are pushed and popped exactly once, then the run-time complexity is
  • filter_dramaExplanation
    Answer is : B
    None.
  • 10. In C programming, when we remove an item from bottom of the stack, then ?
  • filter_dramaExplanation
    Answer is : B
    None.
chevron_left Back Page 1/17 chevron_right Next
leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points