Process of inserting an element in stack is called

• Create

• Push

• Evaluation

• Pop

In a stack,if a user tries to remove an element from an empty stack is called

• Underflow

• Empty collection

• Overflow

• Garbage collection

Consider the following operations on stack of size 5.

After completion of all the operations,the no of elements present on stack is

• 1

• 2

• 3

• 4

If the array index starts with 0, the maximum value of top which does not cause stack overflow is?

• 8

• 9

• 10

• 11

Stack belong to which order

• FIFO

• LIFO

• FILO

• LILO

Process of removing an element from stack is called

• Create

• Push

• Pop

• Evaluation

What is the time complexity of following code:

• O(N)

• O(N*LOG(N))

• O(N*N)

• O(N*sqrt(N))

The postfix expression abc+de/*- is equivalent to which of the following infix expression?

• abc+-de*/

• (a+b)-d/e*c

• a-(b+c)*(d/e)

• abc+*-(d/e)

Which of the following asymptotic notations is used to provide lower bound constraint?

• Big O

• Big omega

• Big theta

• None

What is the value of the postfix expression 6 3 2 4 + - *

• 1

• 40

• 74

• -18