Stacks and Queues Mcqs

Our collections of Multiple choice questions and answers focuses on study of ” Stacks and Queues ” in Data Structures. These questions are chosen from a collection of most authoritative and best reference books on Data Structures. Our aim is to prepare an individual for competitive exams like NTS | GAT | ECAT | Data Warehouse jobs | Data Mining | DB administration jobs Software House and Computer Programmer jobs | University and College entrance exams and various tests and job interviews. One should practice our Mcqs to assimilate knowledge on Stacks and Queues comprehensively.

  1. Home
  2. »
  3. Computer Science Mcqs
  4. »
  5. Data Structures Mcqs
  6. »
  7. Stacks and Queues Mcqs
  8. »
  9. Page 3

Computer MCQS

Sciences MCQS

31.
Convert the following infix expression to postfix expression -A / B ^ C + D * E – A * C

A B C / ^ D E * + A C * -

A B C ^ / D * E + A C * -

A B C ^ / D E * + A * C -

A B C ^ / D E * + A C * -

Answer Discus (0)

32.
Convert the following infix expression to postfix expression -B * C – C + D / A / ( E + E )

B C * C - D A / E E + / +

B C C * - D A / E E + / +

B C C - * D A / E E + / +

B C C - * D / A E E + / +

Answer Discus (0)

33.
Convert the following Infix expression to Postfix form using a stackx + y * z + (p * q + r) * s, Follow usual precedence rule and assume that the expression is legal.

Xyz*+pq*r+s*+

Xyz*+pq*r+s+*

Xyz+*pq*r+s*+

None of the mentioned

Answer Discus (0)

34.
Convert the following infix expressions into its equivalent postfix expressions(A + B ⋀D)/(E – F)+G

(A B D ⋀ + E F – / G +)

(A B D +⋀ E F – / G +)

(A B D ⋀ + E F/- G +)

None of the mentioned

Answer Discus (0)

36.
Entries in a stack are “ordered”. What is the meaning of this statement?

A collection of stacks is sortable

Stack entries may be compared with the ‘<‘ operation

The entries are stored in a linked list

There is a Sequential entry that is one by one

Answer Discus (0)

37.
Evaluate Postfix expression from given infix expression.A + B * (C + D) / F + D * E

AB+CD*F/+D*E

ABCD+*F/+DE*+

ABCD+*/F+DE*

AB+CD*F/+DE*

Answer Discus (0)

39.
Expression in which Operator is written after Operand is called as ________.

Infix Expression

Postfix Expression

Prefix Expression

None of the above

Answer Discus (0)

41.
Following sequence of operations is performed on a stack push(1),push(2),pop, push(1),push(2)pop,pop,pop,push(2),pop.The sequence of poped out values are

2,1,2,2,1

2,1,2,2,2

2,2,1,1,2

2,2,1,2,2

Answer Discus (0)

43.
Given below is the Node class to perform basic list operations and a Stack class with a no arg constructor. Select from the options the appropriate push() operation that can be included in the Stack class. Also ‘first’ is the top-of-the-stack.

A

B

C

D

Answer Discus (0)

44.
Given below is the Node class to perform basic list operations and a Stack class with a no arg constructor.Select from the options the appropriate pop() operation that can be included in the Stack class. Also ‘first’ is the top-of-the-stack.

A

B

C

D

Answer Discus (0)

45.
Here is an infix expression: 4 + 3*(6*3-12). Suppose that we are using the usual stack algorithm to convert the expression from infix to postfix notation.The maximum number of symbols that will appear on the stack AT ONE TIME during the conversion of this expression?

1

2

3

4

Answer Discus (0)

Engineering MCQS

General Subjects MCQS

error: You are not allowed to do so.....
0Shares
0
Scroll to Top