# Data Structure (DS) Solved MCQs

126.

A. lifo
B. fifo
C. both a & b
D. none of these
127.

A. push
B. pop
C. peek
D. none of these
128.

A. lifo
B. fifo
C. both a & b
D. none of these
129.

A. 4
B. 3
C. 2
D. 1
130.

A. array
C. tree
D. none of these
131.

A. front
B. rear
C. both a & b
D. none of these
132.

A. push
B. pop
C. display
D. enqueue
133.

A. push
B. pop
C. display
D. enqueue
134.

A. push
B. pop
C. display
D. peek
135.

A. null
B. garbage
C. 1
D. 2
136.

A. o(n)
B. o(log(n))
C. o(1)
D. n/a
137.

A. o(log(n))
B. o(1)
C. n/a
D. o(n)
138.

A. o(n)
B. o(1)
C. o(log(n))
D. n/a
139.

## Minimum number of fields in each node of a doubly linked list is____

A. 2
B. 3
C. 4
D. None of the above
140.

## A graph in which all vertices have equal degree is known as ____

A. Complete graph
B. Regular graph
C. Multi graph
D. Simple graph
141.

## A vertex of in-degree zero in a directed graph is called a/an

A. Root vertex
B. Isolated vertex
C. Sink
D. Articulation point
142.

## A graph is a tree if and only if graph is

A. Directed graph
B. Contains no cycles
C. Planar
D. Completely connected
143.

## The elements of a linked list are stored

A. In a structure
B. In an array
C. Anywhere the computer has space for them
D. In contiguous memory locations
Answer» C. Anywhere the computer has space for them
144.

## A parentheses checker program would be best implemented using

A. List
B. Queue
C. Stack
D. Any of the above
145.

## To perform level-order traversal on a binary tree, which of the following data structure will be required?

A. Hash table
B. Queue
C. Binary search tree
D. Stack
146.

## Which of the following data structure is required to convert arithmetic expression in infix to its equivalent postfix notation?

A. Queue
C. Binary search tree
D. None of above
147.

## A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.

B. Complete binary tree
C. M-way search tree
D. Full binary tree
148.

## Which of following data structure is more appropriate for implementing quick sort iteratively?

A. Deque
B. Queue
C. Stack
D. Priority queue
149.

A. n(n+1)/2
B. n(n-1)/2
C. n2/2
D. n
150.

## If two trees have same structure and but different node content, then they are called ___

A. Synonyms trees
B. Joint trees
C. Equivalent trees
D. Similar trees