General Data Structures And Algorithms MCQs

89. Which information is not saved in the activation record when a function call is executed?

90. The linked list implementation of sparse matrices is superior to the generalized dope vector method because it is __________.

91. Which situation occurs frequently if the selected hash function is poor?

92. The post-order traversal of a binary tree starts with:

93. One difference between a queue and a stack is:

94. Using which traversal in a sorted binary insertion tree can a sorted array of numbers be obtained?

95. Where does the push member function place the new entry on the linked list in the linked list implementation of a queue?

96. Which term is used to describe an O(n) algorithm?

97. What is the minimum number of nodes in a complete binary tree with depth 3?

98. What is true of the complete bipartite graphs K(3,3) and K(2,4)?

99. If X is the adjacency matrix of a graph G with no self loops, the entries along the principle diagonal of X are ______.

100. Consider a linked list implementation of a queue with two pointers: front and rear. The time needed to insert element in a queue of length n is:

101. What is the worst-case scenario for mergesort to sort an array of n elements?

102. Consider a hashing function that resolves collision by quadratic probing. Assume that the address space is indexed from 1 to 8. If a collision occurs at position 4, the location which will never be probed is:

103. In which data structure is the concept of rotation used?

104. You have implemented a queue with a circular array keeping track of the first, the last, and the count (the number of items in the array). Suppose the first is zero, and the last is CAPACITY-1, what can you say about the count?

105. A procedure that calls itself in a program is called _______.

106. State whether True or False. For all possible inputs, a linear algorithm to solve a problem must perform faster than a quadratic algorithm to solve the same problem.

107. If a max heap is implemented using a partially filled array called data, and the array contains n elements (n > 0), where is the entry with the greatest value?

108. What is the worst-case scenario for quicksort to sort an array of n elements?

109. Which of the following lines of the code will delete two successive nodes of a single linked linear list(with more than two nodes)? Here 'LINK[X]' denotes the address field of node X.

110. A non- planar graph with the minimum number of vertices has:

111. A circuit which is a connected graph and which includes every vertex of the graph is known as_____.

112. A one dimensional array A has indices 1...75. Each element is a string and takes up three memory words. The array is stored starting at location 1120 decimal. The starting address of A[49] is:

113. A simple graph in which there exists an edge between every pair of vertices is called a/an _________.

114. Let A be a sorted array of n=10 elements. Assume that only one comparison is required to determine whether the target is equal to, less than, or greater than A[i]. Which of the following denotes the average successful time of finding an arbitrary element x in A using the binary search?

115. Which operations require linear time for their worst-case behavior in the linked-list version of a queue?

116. Which of the following statements about binary trees is false?

117. How many real links are required for a sparse matrix having 10 rows, 10 columns and 15 non-zero elements? (Pick the nearest answer)

118. In a graph G having the cut set matrix C(G) and an incidence matrix A(G), the rank of C(G) would be____

119. Which of the operations is simpler in the doubly linked list than it is in the simple linked list?

120. Which of the following formulae in big-Oh notation best represents the expression n2+35n+6?

121. The operation for removing an entry from a stack is traditionally called _______.

122. Which queue allows insertion and deletion at both ends?

123. What kind of initialization needs to be done for a chained hash table?

124. The number of nodes in the largest maximal independent set of the complete bipartite graph K(4,2) is_____ .

125. Which of the following techniques is used to resolve collision in hashing?

126. You have implemented a queue with a linked list keeping track of a front pointer and a rear pointer. Which of these pointers will you change during an insertion into a NONEMPTY queue?

127. Which of the following operations is performed more efficiently by the doubly linked list than by the linear linked list?

128. Four characters are placed in a queue in the following order: D, C, B, and A. If they are removed one at a time, what will be the order of their removal?

129. What is the meaning of the statement: "Entries in a stack are 'ordered'"?

130. A given connected graph G is a Euler graph if and only if all vertices of G are of ______.

131. Which of the following data structures has a balanced condition?

132. A matrix is called sparse when______

133. Which of the following operations in the simple linked list will modify the beginning of the linked list?

134. You have implemented a queue with a circular array keeping track of the first item, the last item, and the count (the number of items in the array). Suppose the address of the first is zero, and that of the last is CAPACITY-1, what can you say about the count?

135. In the linked representation of a sparse matrix, the head node for a column list stores_____

136. The hashing function which dynamically adapts to changes in the table being accessed is called ________.

137. What will happen if in data structure a pop operation on the stack causes the stack pointer to move past the origin of the stack?

138. If h is the depth of the tree, which formula will be used to find the maximum number of nodes n in a perfect binary tree?

139. What is the minimum number of edges and vertices possible in a non- planar graph?

140. Which of the following is the worst-case scenario for operations on heaps?

141. Which of these are standard operations of Stack Data Structure?

142. Suppose we have a circular array implementation of a queue, with ten items in the queue stored at data[2] through data[11]. The CAPACITY is 42. Where does the enqueue member function place the new entry in the array?

143. A binary search tree is generated by inserting the following integers in the order: 50,15,62,5,20,58,91,3,8,37,60,24. How many nodes are in the left and right subtrees, respectively?

144. What is the worst-case scenario for the binary search for finding a single item in an sorted array?

145. What is the maximum depth of recursive calls a function may make?

147. You have implemented a queue with a linked list keeping track of a front pointer and a rear pointer. Which of these pointers will you change during an insertion in the middle of a NONEMPTY queue?

148. The number of distinct simple graphs with up to three nodes is _______.

149. Which formula is the best approximation for the depth of a heap with n nodes?

150. What do we call a binary tree in which all the levels, except possibly the last level, have the maximum number of nodes, and in which all the nodes at the last level appear as far left as possible?

151. A binary tree, all the levels of which except possibly the last have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is known as:

152. Which of the following operations is more expensive in the dynamically created linked list than it is in the conventional array?

153. In a selection sort algorithm, the number of passes required to perform the sort are ______.

155. What kind of list is the best to answer questions such as "Which is the item at position n?"

156. The breadth-first traversal (BFS) is a method to traverse______

157. Let A be a sorted array of n=10 elements. Assume that only one comparison is required to determine whether the target is equal to, less than, or greater than A[i]. Which of the following denotes the average successful time of finding an arbitrary element x in A using the binary search?

158. Which of the following tree traversal techniques reads the root before its children nodes?

159. Which of the following operations is more expensive in the array implementation of the linked list than it is in the dynamically created linked list?

160. Which of the following stack operations could result in a stack underflow?

161. In an AVL tree, if the balance factor of a node is -1, which of the following statement/s is/are true?

162. Which statement is true for a B-tree?

163. What is the minimum number of nodes in a full binary tree with height 3?

164. Which of these is the correct big -Oh expression for 1+2+3+...+n?

165. In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is

166. What should be added in place of "/*ADD A STATEMENT HERE*/", so that the function correctly reverses a linked list.

167. Is it possible to create a doubly linked list using only one pointer with every node.

168. Suppose each set is represented as a linked list with elements in arbitrary order. Which of the operations among union, intersection, membership, cardinality will be the slowest?

169. Which of the following operations is performed more efficiently by doubly linked list than by linear linked list?

170. The time required to search an element in a linked list of length n is

171. Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?

172. Assume that reference of head of following doubly linked list is passed to above function 1 <--> 2 <--> 3 <--> 4 <--> 5 <-->6. What should be the modified linked list after the function call?

173. Which of the following points is/are true about Linked List data structure when it is compared with array

174. A heuristic is a(n) ____.

175. A member function that is declared ________ may not access any non-static data members in the class

176. A(n) ________ informs the compiler that a class will be declared later in the program.

177. Each object of a class has its own copy of the class's ________.

178. Every element in an array is assigned a unique number known as a ________.

179. In a truth table, the expression ____ is false.

180. In a truth table, the expression ____ is true

181. ____ methods are methods that exist to be used with an object created from a class.

182. ________ algorithms are used to arrange random data into some order.

183. ________ allows for very recent file changes to be restored.

184. ________ is a data structure to store data in sequential order.

185. The sequential search algorithm uses a(n) ____ variable to track whether the item is found.

186. You use the ________ operator to access members of an object.

187. The following pseudocode is an example of a ____ structure.

188. To build a list initially, you can use a(n) ________ routine.

189. When an array is sorted from highest to lowest, it is said to be in ________ order.

190. When you create a ____ report, the records must have been sorted in order by a key field.

191. When you return an array from a method, the method returns ________.

192. When you use an index, you can store records on a ____ storage device.

193. The number of elements an array will hold is known as the ____ of the array.

194. When you derive a class from an existing class, you ________ add new data and functions.

195. A loop must return to the ____ question at some later point in a structure.

196. A loop within another loop is known as a(n) ____ loop.

197. Arrays, unlike simple built-in types, are passed by ____.

198. Java.util.vector is a subtype of ________.

199. Attaching structures end to end is called ____ structures.

200. The maximum number of entry points that any programming structure can have is ____.

201. A ____ is a copy that is kept in case values need to be restored to their original state.

202. The priming read is an example of a(n) ____ task.

203. To describe a queuing system, we use the term ____ for the object that provides the service.

204. Selection sort requires ________ passes to put n data items in order.

205. Data can be organized and processed sequentially using an array, called a(n) ____ list.

206. A three-dimensional array can be thought of as ________ of two-dimensional arrays.

207. A two-dimensional array can be viewed as ___________ and _____________.

208. A variable or a value listed in a call to a method is called ________.

209. The elements of an array are stored in __________ storage locations in the computer?s memory.

210. The expression score[5] is pronounced ________.

211. Before a structure variable can be created, the structure must be _________.

212. Fill in the code in comparable________ c = new date();

213. If an exception occurs in a try-catch block, the code in the finally clause ________.

214. After you create an array variable, you still need to ____ memory space.

215. The ________ represents a special value that marks the end of a list of values.

216. A ________ is used to travel through a linked list and search for data.

217. A bubble sort is sometimes called a ____.

218. A(n) ________ member variable may be accessed before any objects of the class have been declared.

219. Pseudocode uses the end-structure statement ____ to clearly show where the structure ends.

220. When an array is passed to a function, it is actually ________ the array that is passed.

221. The following pseudocode is an example of ____.

222. The ________ function does the same thing as using the mathematical ∧ operator.

223. The starting value of an algorithm used to generate a range of numbers is called the _________.

224. When mathematicians use a two-dimensional array, they often call it a ____ or a table.

225. An array whose elements you can access using a single subscript is a ____ array.

226. Each element in a two-dimensional array requires ____ subscript(s) to reference it.

227. If a one-dimensional array contains five elements, its highest subscript is ____.

228. In a ____, items in a list are compared with each other in pairs.

229. In all languages, subscript values must be sequential ____.

230. Programmers sometimes refer to a situation in which nothing goes wrong as the ____ case.

231. The number of elements in an array is called the ____ of the array.

232. To arrange the elements in an array in ascending order, you use the ____ method.

233. Every node (except of the last node) in a singly linked list contains ____.

234. When working with multiple sets of data, one would typically use a ________.

235. The rijndael algorithm is better known today as __________.

236. A ________ search uses a loop to sequentially step through an array.

237. A(n) ________ search uses a loop to sequentially step through an array.

238. In comparison with unstructured information, semi-structured information ________.

239. The ____ function is used to create a constant.

240. A variable defined inside a method is referred to as ________.

241. The body of a ______-test loop is always executed at least once.

242. Suppose integer x = new integer(3); x holds ________.

243. Two-dimensional arrays can be thought of as containing ________.

244. A(n) ______ is a process or set of operations in a calculation.

245. A(n) ____ is shorthand for the detail you want to use in a search filter.

246. A ____ is a rectangular area into which the user can type text.

247. A variable usually is passed into a method by ____.

248. A(n) ____ tells the user what to enter.

249. Structures can be stacked or connected to one another at their ____.

250. The ____ is skewed by a few very high or low values.

251. A collection in the items stored there are of different types is referred to as a(n) ________ type.

252. Assume s is "abcabc", the method ________ returns an array of characters.

253. When computers sort data, they always use ____ values when making comparisons between values.

254. A ____ read is an added statement that gets the first input value in a program.

255. Because “a” is always less than “b”, alphabetic sorts are ____ sorts.

256. In a function template, the programmer substitutes ________ for ________.

257. Members of a(n) ________ union have names, but the union itself has no name.

258. With a hollow structure, the organization ____.

259. With a(n) ____, you perform an action or task, and then you perform the next action, in order.

260. In a(n) ____________________ data type, each data item is a collection of other data items.

261. A(n) ____ control is any type of input mechanism on a form.

262. The __________ places new orders when inventory levels fall to predetermined points.

263. Infiniband can support data transfer speeds of ____ per second.