Saturday, 21 October 2017

Multiple Choice Question on Data Structure

Q. 1. Stack is also called as
A) Last in first out
B) First in last out
C) Last in last out
D) First in first out

Q. 2. Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.
A) push, pop
B) pop, push
C) insert, delete
D) delete, insert

Q. 3. ………… is very useful in situation when data have to stored and then retrieved in reverse order.
A) Stack
B) Queue
C) List

Q. 4. Which of the following data structure is linear type?
A) Graph
B) Trees
C) Binary tree
D) Stack

Q. 5. What will be the value of top, if there is a size of stack STACK_SIZE is 5
A) 5
B) 6
C) 4
D) None

Q. 6. Which is/are the application(s) of stack
A) Function calls
B) Large number Arithmetic
C) Evaluation of arithmetic expressions
D) All of the above

Q. 7. When does top value of the stack changes?
A) Before deletion
B) While checking underflow
C) At the time of deletion
D) After deletion

Q. 8. Which of the following is an application of stack?
A) finding factorial
B) tower of Hanoi
C) infix to postfix conversion
D) all of the above

Q. 9. The data structure which is one ended is ………………
A) queue
B) stack
C) tree
D) graph

Mukesh Rajput

No comments:

Post a Comment

Mukesh Rajput