Stacks Questions

MCQ bookmark_border

111.

Stack is useful for implemeting

A

recursion

B

depth first search

C

both (a) and (b)

D

breadth first search

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

112.

An item that is read as input can be either pushed to a stack and later popped and printed, or printed directly. Which of the following will be the output if the input is the sequence of items 1, 2, 3

A

1, 5, 2, 3, 4

B

3, 4, 5, 2, 1

C

3, 4, 5, 1, 2

D

5, 4, 3, 1, 2

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

113.

Process of inserting an element in stack is called ____________

A

Create

B

Push

C

Evaluation

D

Pop

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

114.

Process of removing an element from stack is called __________

A

Create

B

Push

C

Evaluation

D

Pop

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

115.

In a stack, if a user tries to remove an element from empty stack it is called _________

A

Underflow

B

Empty collection

C

Overflow

D

Garbage Collection

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

116.

Pushing an element into stack already having five elements and stack size of 5 , then stack becomes

A

Overflow

B

Crash

C

Underflow

D

User flow

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

117.

Entries in a stack are

A

A collection of stacks is sortable

B

Stack entries may be compared with the

C

The entries are stored in a linked list

D

There is a Sequential entry that is one by one

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

118.

Which of the following applications may use a stack?

A

A parentheses balancing program

B

Tracking of local variables at run time

C

Compiler Syntax Analyzer

D

All of the mentioned

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

119.

Consider the usual algorithm for determining whether a sequence of parentheses is balanced.The maximum number of parentheses that appear on the stack AT ANY ONE TIME when the algorithm analyzes: (()(())(())) are:

A

1

B

2

C

3

D

4 or more

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

120.

Consider the usual algorithm for determining whether a sequence of parentheses is balanced.
Suppose that you run the algorithm on a sequence that contains 2 left parentheses and 3 right parentheses (in some order).

The maximum number of parentheses that appear on the stack AT ANY ONE TIME during the computation?

A

1

B

2

C

3

D

4 or more

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion