Data Structure · all questions

Stacks in Data Structures
practice.

Practice every MCQ with options. Use Show answers when you want the correct option and solution.

159

Questions

6/8

Page

Pick an option on a question to see the right answer and solution.

Q101

Which of the following does the balancing symbols algorithm include?

Select an option to see the answer and solution.

Q102

Find the error (if any) in the following code snippet for pop operation.

void pop() //removing an element from a stack
{
     printf(“%s”, stack[top++]);
}

Select an option to see the answer and solution.

Q103

What would be the solution to the given prefix notation?

- * 1 5 / * / 6 3 6 2

Select an option to see the answer and solution.

Q104

Which data structure can be used to test a palindrome?

Select an option to see the answer and solution.

Q105

Evaluate the following statement using infix evaluation algorithm and choose the correct answer. 4*2+3-5/5

Select an option to see the answer and solution.

Q106

The result of the postfix expression 5 3 * 9 + 6 / 8 4 / + is . . . . . . . .

Select an option to see the answer and solution.

Q107

When an operand is read, which of the following is done?

Select an option to see the answer and solution.

Q108

Find the output of the following prefix expression.

*+2-2 1/-4 2+-5 3 1

Select an option to see the answer and solution.

Q109

Which of the following is an example for a postfix expression?

Select an option to see the answer and solution.

Q110

What should be done when a left parenthesis '(' is encountered?

Select an option to see the answer and solution.

Q111

Of the following choices, which operator has the lowest precedence?

Select an option to see the answer and solution.

Q112

What would be the solution to the given prefix notation?

- + 5 / 10 5 5

Select an option to see the answer and solution.

Q113

It is easier for a computer to process a postfix expression than an infix expression.

Select an option to see the answer and solution.

Q114

If -*+abcd = 11, find a, b, c, d using evaluation of prefix algorithm.

Select an option to see the answer and solution.

Q115

The associativity of an exponentiation operator ^ is right side.

Select an option to see the answer and solution.

Q116

While evaluating a postfix expression, when an operator is encountered, what is the correct operation to be performed?

Select an option to see the answer and solution.

Q117

What would be the Prefix notation for the given equation?

(A*B)+(C*D)

Select an option to see the answer and solution.

Q118

What is the corresponding postfix expression for the given infix expression?

a+(b*c(d/e^f)*g)*h)

Select an option to see the answer and solution.

Q119

Identify the infix expression from the list of options given below.

Select an option to see the answer and solution.

Q120

The optimal data structure used to solve Tower of Hanoi is . . . . . . . .

Select an option to see the answer and solution.

Prev 4 5 6 7 8 Next