MCQ ON STACK
1]………….is linear list in which all the operations
restricted from one end.
a) stack b) array c)
pop d) pointer
2] which of the following operation is not stack
operation…?
a)
push b) pop c) stack push d)
stack top
3]………..operation used to insert data into the stack.
a) pop b)push c)
stack top d)stack push
4] If there is no enough space in the stack that
state known as………
a)
underflow state b) outflow state c) overflow state d)none
5]]……..add item at………..of stack after pushing item
in stack top of stack ……….by 1 and become a new top.
a)
push, bottom, increment b)push,
top, decrement
c) push, top,
increment d) pop, bottom,
decrement
6] Pop used to……
a) remove item
from stack b) add item in
stack
c)
copy item in stack d)
none of above
7] If pop is called when stack is empty then it is
known as……….
a) overflow state b) underflow
state c)outflow state
d)All
of above
8] stack top gives us…………..state
a)
overflow b) underflow c)both d)
none
9] when stack is empty its size can be……..
a) 1 b) -1 c) 0 d)
Null
10] algorithm
…………….()
{
If
(top>size-1) then
Return 1;
Else
Return 0;
}
If (……………()==1)
This is algorithm to cheak…!!!!
a) Stack full b)stack empty c)both d) none
11] which of the following is not stack
application…..
a)
infix expression evolution
b)
prefix expression evolution
c)
postfix expression evolution
d)data retrieving from front
M.C.Q of Queue
1) In Queue Insertion & Deletion take place at ---------
a)same end b)first
end c)different end
D)last end
2) The end at which element is added is called------
Ans:=rear
3) The old element is deleted is called------
Ans= Front
4) Queue is a------
a)LIFO b)Infix to
Postfix c)FILO d)FIFO
5) ---------- : Insert an element at the rear end of the
queue.
a)dequeue
b)initialize c)enqueue( ) d)both a
& b
6) --------- : Delete the Frant element.
a)dequeue
b)initialize c)enqueue( ) d)both a & b
7) --------- is the general representation of both stack &
queue.
a) dequeue
b)postfix c)enqueue d)link list
No comments:
Post a Comment