Top 150+ Solved Data Structure (DS) MCQ Questions Answer
Q. A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.
a. circular queue
b. random of queue
c. priority
d. dequeue
Q. Which of the following name does not relate to stacks?
a. fifo lists
b. lifo list
c. piles
d. push-down lists
Q. A data structure where elements can be added or removed at either end but not in the middle is called …
a. arrays
b. stacks
c. queues
d. deque
Q. What is the postfix form of the following prefix expression -A/B*C$DE ?
a. abcde$*/-
b. a-bcde$*/-
c. abc$ed*/-
d. a-bcde$*/
Q. The data structure required to evaluate a postfix expression is
a. queue
b. stacks
c. array
d. linked-list
Q. What is the postfix form of the following prefix:*+ab–cd
a. ab+cd–*
b. abc+*–
c. ab+*cd–
d. ab+*cd–
Q. A queue is a,
a. fifo (first in first out) list
b. lifo (last in first out) list
c. ordered array
d. linear tree
Q. In stack terminology, the __________operations are known as push and pop operations respectively.
a. delete
b. insert
c. both (a) and (b)
d. none of the above
Q. A common example of a queue is people waiting in line at a__________.
a. bus stop
b. movie hall
c. shopping mall
d. none of the above
Q. What is one of the common examples of a stack?
a. a pile of books
b. bus stop
c. a basket of fruits
d. a carat of eggs
Q. What happens when the stack is full and there is no space for a new element, and an attempt is made to push a new element?
a. overflow
b. underflow
c. top
d. none of the above
Q. The total number of elements in a stack at a given point of time can be calculated from the value of______.
a. overflow
b. top
c. queues
d. underflow
Q. When the push operation is performed on stack the value of TOS will be ______
a. decrement
b. increment
c. one
d. none of these
Q. A double linked list contains reference to _____
a. previous node
b. next node
c. current node
d. both a & b