Скачать или смотреть CS502 - Fundamentals of Algorithms Grand Quiz Perfect Solution with Explanation & References ✓

#CS502 #CS502GrandQuizSolution #CS502GrandQuiz #CS502SolvedMCQs
One of the limitation in 0/1 knapsack is that an item can either be___________ in the bag or not. put

Insertion sort is an efficient algorithm for sorting a ____________ number of elements. Large

Algorithms similar to those for the ______________ problem are used in some speech recognition systems. Edit distance

In Selection problem, the Sieve technique works in ___________. Phases

Catalan numbers are related the number of different ______ on 'n' nodes. binary trees

Heap sort is a/an ______ and _______ sorting algorithm.in-place, not stable

In chain matrix multiplication, solutions of the sub-problems are stored in a _____. Table

Random Access Machine (RAM) can execute ________________ instructions. logical and arithematic

Two functions 4n2 and (8n2 + 2n − 3) are _______________. asymptotically equivalent

In asymptotical analysis of n(n - 3) and 4n*n, as n becomes large, the dominant (fastest growing) term is some constant times________. n*n

Cubic function will ______ a quadratic function. overtake

___________________is in-place sorting algorithm. Bubble sort

In inductive approach of knapsack problem, we consider 2 cases, ______Or _________. Leave object, Take object

A Random Access Machine (RAM)is an idealized machine with ___________ random access memory. infinitely large

There are __________ entries in the Edit Distance Matrix. n2

In Running Time Analysis, we are also concerned about the _______________ required by the algorithm. Both space and memory

To find maximal points in brute-force algorithm, each point of the space is compared against ________of that space. All other points

Al-Khwarizmi was a/an __________. mathematician

Which process is used for avoiding unnecessary repetitions and looking them up again if we need them later. Memoziation

Developing a dynamic programming algorithm generally involves __________ separate steps. Two

Merge sort algorithm discussed in handouts contains ________. 4 loops

Which symbol is used for Omega notation? big-Ω notation

Plane-Sweep algorithm can run in _______ time. (n log n)

For average-case time analysis of quick sort algorithm, pivot selection is on average basis from _________.

In average-case time analysis of quick sort algorithm, the most balanced case for partition is when we divide the list of elements into _________. Three nearly equal pieces

In the statement “output P[i].x, P[i].y”, the number of times elements of P are accessed is _____________ 2

In merge sort algorithm, to merge two lists of size n/2 to a list of size n, takes ___________ time. Theta(n)

In Dynamic Programming, our approach is to ____________. Build the solution in bottom-up fashion