In the stack process of inserting an element in the stack is called as ___________.

Evaluation

Pop

Push

Create

SHOW ANSWERProcess of Removing element from the stack is called as __________.

Create

Postfix Expression

Push

Pop

SHOW ANSWERIn the stack, If user try to remove element from the empty stack then it called as ___________.

Empty Collection

Underflow of Stack

Overflow of Stack

Garbage Collection

SHOW ANSWERUser push 1 element in the stack having already five elements and having stack size as 5 then stack becomes ___________.

Overflow

User Flow

Crash

Underflow

SHOW ANSWERUser perform following operations on stack of size 5 then -

push(1);

pop();

push(2);

push(3);

pop();

push(4);

pop();

pop();

push(5);

at the end of last operation, total number of elements present in the stack are -

1

2

3

4

SHOW ANSWERIn order to keep track of current topmost element of the stack we need to maintain one variable.

True

False

SHOW ANSWERConsider Stack is implemented using the array.

#define MAX 10

struct STACK

{

int arr[MAX];

int top = ___________;

}What will be the initial value with which top is initialized.

-1

1

Garbage

0

SHOW ANSWERConsider Stack is implemented using the array.

#define MAX 10

struct STACK

{

int arr[MAX]

int top = -1;

}

In this implementation of stack maximum value of top which cannot cause overflow will _________.

11

9

10

Any Other

SHOW ANSWERUser perform following operations on stack of size 5 then -

push(1);

pop();

push(2);

push(3);

pop();

push(2);

pop();

pop();

push(4);

pop();

pop();

push(5);

Which of the following is correct statement for stack ?

None of these

Underflow Occures

Overflow Occures

Stack Operations will be performed Smoothly

SHOW ANSWERWhat will be the postfix expression for following infix expression

b * c + d / e

bc*de/+

b*cde/+

bc*de+/

bcd*e/+

SHOW ANSWERWhat will be the postfix expression for following infix expression -

A / B ^ C - D

A B ^ / C D -

A B C ^ / D -

A B / ^ C D -

A B C / ^ D -

SHOW ANSWERWhat will be the postfix expression for following infix expression -

A + B * C ^ D

ABCD*+^

ABCD+*^

ABCD^*+

ABC+D*^

SHOW ANSWEREvaluate 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*

SHOW ANSWER