Stacks Questions

MCQ bookmark_border

41.

When a stack is organized as an array, a variable named Top is used to point to the top element of the stack. Initially, the value of Top is set to_______to indicate an empty stack.

A

-1

C

1

D

x

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

42.

What happens when the stack is full and there is no space for a new element, and an attempt is made to push a new element?

A

Overflow

B

Underflow

C

Top

D

None of the above

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

43.

The total number of elements in a stack at a given point of time can be calculated from the value of______.

A

Overflow

B

Top

C

Queues

D

Underflow

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

44.

Jan Lukasiewicz, who suggested two alternative notations to represent an arithmetic expression belonged to which nationality?

A

English

B

Polish

C

German

D

Swedish

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

45.

In a computer system, when an __________ expression in an infix notation needs to be evaluated, it is first converted into its postfix notation?

A

Algebraic

B

Arithmetic

C

Trigonometric

D

Geometric

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

46.

The postfix form of the following infix notation is : (A + B)* (C*D − E)* F

A

AB + CD*E - *F*

B

AB+ CDE + - * F*

C

AB+ CD - EF + - **

D

ABCDEF* - + * +

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

47.

If the sequence of operations -

push(1)
push(2)
pop
push(1)
push(2)
pop
pop
pop
push(2)
pop

are performed on a stack, the sequence of popped out values are ?

A

2, 2, 1, 1, 2

B

2, 2, 1, 2, 2

C

2, 1, 2, 2, 1

D

2, 1, 2, 2, 2

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

48.

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

?(n^2)

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

49.

The result of evaluating the following postfix expression is5, 7, 9, *, +, 4, 9, 3, /, +, -

A

50

B

65

C

61

D

70

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

50.

An infix expression can be converted to a postfix expression using a .................

A

Stack

B

Queue

C

Dequeue

D

None of these

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion