# Data Structure (DS) Solved MCQs

101.

A. random memory allocation
B. static memory allocation
C. fixed memory allocation
D. dynamic memory allocation
102.

A. 1 type
B. 2 type
C. 3 type
D. 4 type
103.

A. tail
C. terminator
D. initiator
104.

A. nodes
B. arrays
C. entities
D. instances
105.

## How do you calculate the pointer difference in a memory efficient double linked list?

B. pointer to previous node xor pointer to next node
C. pointer to previous node – pointer to next node
D. pointer to next node – pointer to previous node
Answer» B. pointer to previous node xor pointer to next node
106.

## 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
107.

## Which of the following name does not relate to stacks?

A. fifo lists
B. lifo list
C. piles
D. push-down lists
108.

A. arrays
B. stacks
C. queues
D. deque
109.

## The postfix form of the expression (A + B)∗(C∗D − E)∗F / G is

A. ab + cd∗e − fg /∗∗
B. / ab + cd ∗ e − f ∗∗g /
C. ab + cd ∗ e − ∗f ∗ g /
D. ab + cde ∗ − ∗ f ∗ g /
Answer» A. ab + cd∗e − fg /∗∗
110.

A. abcde\$*/-
B. a-bcde\$*/-
C. abc\$ed*/-
D. a-bcde\$*/
111.

A. queue
B. stacks
C. array
112.

A. ab+cd–*
B. abc+*–
C. ab+*cd–
D. ab+*cd–
113.

## A queue is a,

A. fifo (first in first out) list
B. lifo (last in first out) list
C. ordered array
D. linear tree
Answer» A. fifo (first in first out) list
114.

## 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
Answer» C. both (a) and (b)
115.

## 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
116.

## What is one of the common examples of a stack?

A. a pile of books
B. bus stop
D. a carat of eggs
Answer» A. a pile of books
117.

A. -1
B. 0
C. 1
D. x
118.

## 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
119.

A. overflow
B. top
C. queues
D. underflow
120.

A. decrement
B. increment
C. one
D. none of these
121.

## A double linked list contains reference to _____

A. previous node
B. next node
C. current node
D. both a & b
Answer» D. both a & b
122.

## Data Structure that are created by user as per their requirement are known as

A. primitive data structure
B. non-primitive data structure
C. both a & b
D. none of these
123.

A. null
B. next node
C. new node
124.

## In linked list implementation, a node carries information regarding

A. the data
C. both a & b
D. none of these
Answer» C. both a & b
125.

A. strings
B. stack
C. queue
D. all of these