Menu

Question Discussion & Solution

MCQ

Q.

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.

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

One can determine whether an infix expression has balanced parenthesis or not by using .............

A

Array

B

Queue

C

Stack

D

Tree

Discussion

MCQ

2.

Which data structure can be used suitably to solve the Tower of Hanoi problem?

A

Tree

B

Heap

C

Priority queue

D

Stack

Discussion

MCQ

3.

Stack is useful for implemeting

A

recursion

B

depth first search

C

both (a) and (b)

D

breadth first search

Discussion

MCQ

4.

The postifx expression for the infix expression A + B* (C+D) / F + D*E is

A

AB+CD + *F/ D+E*

B

A + *BCD/ F* DE ++

C

A*B + CD / F* DE ++

D

ABCD + *F / + DE* +

Discussion

MCQ

5.

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

A

AB+CD*F/+D*E

B

ABCD+*F/+DE*+

C

ABCD+*/F+DE*

D

AB+CD*F/+DE*

Discussion

More Data Structure Topics

Data Structure Basics

128 MCQs

Abstract data types

37 MCQs

Arrays

134 MCQs

Lists

166 MCQs

Stacks

165 MCQs

Queues

61 MCQs

Trees

133 MCQs

Binary Trees

120 MCQs

B Trees

8 MCQs

Heaps

36 MCQs

Hash based structures

7 MCQs

Graphs

157 MCQs

Mixed

10 MCQs