Data Structures and Algorithms MCQ - 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?

A
b a c
B
b c a
C
c a b
D
a b c

View Explanation
Comment

Correct AnswerOption C

Rate difficulty Rate difficulty:

Easy Medium Hard

Choose a difficulty.

Cancel reply

Your email address will not be published. Required fields are marked *

Report

Name

Save my name and email in this browser for the next time I comment.

Cancel reply

Your email address will not be published. Required fields are marked *

Comment *

Name

Save my name and email in this browser for the next time I comment.

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

A
ab+cd-*
B
ab cd + - *
C
ab + cd * -
D
ab + - cd *

View Explanation
Comment

Correct AnswerOption A

Rate difficulty Rate difficulty:

Easy Medium Hard

Choose a difficulty.

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.

Cancel reply

Your email address will not be published. Required fields are marked *

Report

Name

Save my name and email in this browser for the next time I comment.

Cancel reply

Your email address will not be published. Required fields are marked *

Comment *

Name

Save my name and email in this browser for the next time I comment.

23 Stacks cannot be used to

A
evaluate an arithmetic expression in postfix form
B
iumplemen recursion
C
convert a given arithmetic expression in infix form to its equivalent postfix form
D
allocate resources (like CPU) by the operating system

View Explanation
Comment

Correct AnswerOption D

Rate difficulty Rate difficulty:

Easy Medium Hard

Choose a difficulty.

Cancel reply

Your email address will not be published. Required fields are marked *

Report

Name

Save my name and email in this browser for the next time I comment.

Cancel reply

Your email address will not be published. Required fields are marked *

Comment *

Name

Save my name and email in this browser for the next time I comment.

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

A
AB+CD + *F/ D+E*
B
ABCD + *F / + DE* +
C
A*B + CD / F* DE ++
D
A + *BCD/ F* DE ++

View Explanation
Comment

Correct AnswerOption B

Rate difficulty Rate difficulty:

Easy Medium Hard

Choose a difficulty.

Share this question

Cancel reply

Your email address will not be published. Required fields are marked *

Report

Name

Save my name and email in this browser for the next time I comment.

Cancel reply

Your email address will not be published. Required fields are marked *

Comment *

Name

Save my name and email in this browser for the next time I comment.

25 Stack is useful for implemeting

A
breadth-first search
B
depth-first search
C
recursion
D
Both (b) & (c)

View Explanation
Comment

Correct AnswerOption D

Rate difficulty Rate difficulty:

Easy Medium Hard

Choose a difficulty.

Breadth-first search needs Queue for implementation

Cancel reply

Your email address will not be published. Required fields are marked *

Report

Name

Save my name and email in this browser for the next time I comment.

Cancel reply

Your email address will not be published. Required fields are marked *

Comment *

Name

Save my name and email in this browser for the next time I comment.

First Previous 2 3 4 5 6 Next Last