126. |
## Stack is ____ type of data structure. |

A. | lifo |

B. | fifo |

C. | both a & b |

D. | none of these |

Answer» A. lifo |

127. |
## In stack deletion operation is referred as _____ |

A. | push |

B. | pop |

C. | peek |

D. | none of these |

Answer» B. pop |

128. |
## Queue is _____ type of data structure. |

A. | lifo |

B. | fifo |

C. | both a & b |

D. | none of these |

Answer» B. fifo |

129. |
## Data structre is divided into _____ parts. |

A. | 4 |

B. | 3 |

C. | 2 |

D. | 1 |

Answer» C. 2 |

130. |
## In ___ Data Structure data can be processed one by one sequentially |

A. | array |

B. | linked list |

C. | tree |

D. | none of these |

Answer» B. linked list |

131. |
## When we insert an element in Queue, which pointer is increased by one? |

A. | front |

B. | rear |

C. | both a & b |

D. | none of these |

Answer» B. rear |

132. |
## Which of the following is not the possible operation on stack? |

A. | push |

B. | pop |

C. | display |

D. | enqueue |

Answer» D. enqueue |

133. |
## Which of the following is a possible operation on queue? |

A. | push |

B. | pop |

C. | display |

D. | enqueue |

Answer» D. enqueue |

134. |
## In stack, to display the lastly inserted element without removing it, which function is used? |

A. | push |

B. | pop |

C. | display |

D. | peek |

Answer» D. peek |

135. |
## if there are no nodes in linked list then start pointer will point at which value? |

A. | null |

B. | garbage |

C. | 1 |

D. | 2 |

Answer» A. null |

136. |
## Worst space complexity of queue data structure is |

A. | o(n) |

B. | o(log(n)) |

C. | o(1) |

D. | n/a |

Answer» A. o(n) |

137. |
## Worst space complexity of stack data structure is |

A. | o(log(n)) |

B. | o(1) |

C. | n/a |

D. | o(n) |

Answer» D. o(n) |

138. |
## Worst space complexity of singly linked list is |

A. | o(n) |

B. | o(1) |

C. | o(log(n)) |

D. | n/a |

Answer» A. o(n) |

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 |

Answer» B. 3 |

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 |

Answer» A. Complete 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 |

Answer» C. Sink |

142. |
## A graph is a tree if and only if graph is |

A. | Directed graph |

B. | Contains no cycles |

C. | Planar |

D. | Completely connected |

Answer» B. Contains no cycles |

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 |

Answer» C. Stack |

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 |

Answer» B. Queue |

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

A. | Queue |

B. | Linked list |

C. | Binary search tree |

D. | None of above |

Answer» 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. |

A. | Threaded tree |

B. | Complete binary tree |

C. | M-way search tree |

D. | Full binary tree |

Answer» B. Complete 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 |

Answer» C. Stack |

149. |
## The number of edges in a complete graph of n vertices is |

A. | n(n+1)/2 |

B. | n(n-1)/2 |

C. | n2/2 |

D. | n |

Answer» B. n(n-1)/2 |

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 |

Answer» D. Similar trees |

Tags

Question and answers in Data Structure (DS),
Data Structure (DS) multiple choice questions and answers,
Data Structure (DS) Important MCQs,
Solved MCQs for Data Structure (DS),
Data Structure (DS) MCQs with answers PDF download

We want to make our service better for you. Please take a moment to fill out our survey.

Take Survey