Stacks Questions

MCQ bookmark_border

101.

Using Pop(S1, Item) Push(S1,Item) Read(Item) Print(Item) the variables S1 represents (stack) and Item are given the input file: A,B,C,D,E,F Which stacks are possible:

A

54

B

5

C

543

D

5

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

102.

Using Pop (S1,Item) ,Push(S1, Item), Getlist(Item), Pop(S2,Item), and the variables S1,S2(stacks with Top1 and Top2) and Item and given the input file: A,B,C,D,E,F Which stack are possible?

A

No possible stacks with A,B,C,D,E and F

B

All possible stacks with A,B,C,D,E and F

C

Twice as many stacks as can be produced with S1 alone

D

Exact and only those stacks which can be produced with S1 alone

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

103.

In eveluating the arithmetic expression 2*3-(4+5),using stacks to evaluate its equivalent postfix form, which of the following stack configuration is not possible?

A

4 6

B

9 6

C

5 4 2006

D

9 3 2002

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

104.

Stack A has the entries a,b,c(with a 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 the stack B can only be printed. In this arrangement, which of the following permutations of a,b,c are not possible?

A

b c a

B

b a c

C

c b a

D

c a b

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

105.

Stack can't be used to

A

Implement recursion

B

Evaluate an arithmetic expression in postfix form

C

Allocate resources(like CPU)by the operating system

D

Convert a given arithmetic expression in infix form to its evaluate postfix form

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

106.

Which of the following permutations can be obtained in the output(in the same order),using a stack assuming that the input is the sequence 1,2,3,4,5 in that order?

A

1,5,2,3,4

B

3,4,5,2,1

C

3,4,5,1,2

D

5,4,3,2,1

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

107.

Stack is useful for implementing

A

Radix

B

Recursion

C

Breadth first search

D

None of these

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

108.

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

A

ab+cd-*

B

ab + cd * -

C

ab + - cd *

D

ab cd + - *

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

109.

Stacks cannot be used to

A

implement recursion

B

evaluate an arithmetic expression

C

allocate resources (like CPU) by the operating system

D

convert a given arithmetic expression in infix form to its equivalent postfix form

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

110.

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

A

AB+CD + *F/ D+E*

B

A + *BCD/ F* DE ++

C

A*B + CD / F* DE ++

D

ABCD + *F / + DE* +

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion