Data Structures and Algorithms - Stacks

Avatto > > UGC NET COMPUTER SCIENCE > > PRACTICE QUESTIONS > > Data Structures and Algorithms > > Stacks

21. Stack A has the entries a, b, c (with an on top), Stack B is empty. An entry popped out of stack A can be printed immediately or pushed to stack B. An entry popped out of stack B can only be printed. In the arrangement, which of the following permutations of a, b, c is not possible?

Answer
Comment
Array

Option : C
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

22. The postfix equivalent of the prefix * + a b - c d is

Answer
Comment
Array

Option : A
Explanation : The tree whose preorder traversal yields * + A B – C D, is given in fig 6.18. Writer the post-order traversal of the tree. That is the postfix form.

You must be logged in to post a comment.

You must be logged in to post a comment.

23. Stacks cannot be used to

Answer
Comment
Array

Option : D
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

24. The postfix expression for the infix expression A + B* (C+D) / F + D*E is

Answer
Comment
Array

Option : B
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

25. Stack is useful for implemeting

Answer
Comment
Array

Option : D
Explanation : Breadth-first search needs Queue for implementation

You must be logged in to post a comment.

You must be logged in to post a comment.

Related Quiz.
Stacks

Forgot your password?

I agree with the Terms.