Stacks Questions

MCQ bookmark_border

1.

In a Stack the command to access nth element from the top of the stacks will be

A

S[Top-n]

B

S [Top+n]

C

S [top-n-1]

D

None of the above

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

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: (()(())(()))

A

1

B

2

C

3

D

4

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

3.

A

Stack

B

Queue

C

List

D

Link list

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

4.

Stack is used for

A

CPU Resource Allocation

B

Breadth First Traversal

C

Recursion

D

None of the above

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

5.

push() and pop() functions are found in

A

queues

B

lists

C

stacks

D

trees

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

6.

If locality is a concern, you can use _______ to traverse the graph.

A

Breadth First Search

B

Depth First Search

C

Either BFS or DFS

D

None of the above!

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

7.

Aposterior analysis are more accurate than apriori analysis because ?

A

it contains the real data.

B

it assumes all other factors to be dynamic.

C

it assumes all other factors to be constant.

D

it is a result of reverse-engineering.

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

8.

Prefix notation is also known as

A

Reverse Polish Notation

B

Reverse Notation

C

Polish Reverse Notation

D

Polish Notation

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

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

A

?(1)

B

?(n)

C

?(log n)

D

?(n2)

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

10.

In C programming, when we remove an item from bottom of the stack, then ?

A

The stack will fall down.

B

Stack will rearranged items.

C

It will convert to LIFO

D

This operation is not allowed.

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion