Miscellaneous On Data Structures - Study Mode
[#971] . . . . . . . . is a method of constructing a smallest polygon out of n given points.
Correct Answer
(B) quick hull problem
[#972] In most of the cases, topological sort starts from a node which has . . . . . . . .
Correct Answer
(D) Zero Degree
[#973] What is the recurrence relation used in Strassen's algorithm?
Correct Answer
(A) 7T(n/2) + Theta(n 2 )
[#974] In a FIFO algorithm, when a page is to be replaced, which of the following page is chosen?
Correct Answer
(A) Oldest page
[#975] The time complexity of the solution tower of hanoi problem using recursion is . . . . . . . .
Correct Answer
(B) O(2 n )