CS502-Midterm
1 / 50
Which sorting algorithm is faster
2 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
3 / 50
Random access machine or RAM is a/an
4 / 50
Quick sort is
5 / 50
For the worst-case running time analysis, the nested loop structure containing one “for” and one “while” loop, might be expressed as a pair of _________nested summations.
6 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
7 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
8 / 50
For the heap sort, access to nodes involves simple _______________ operations.
9 / 50
How much time merge sort takes for an array of numbers?
10 / 50
_______________ is a graphical representation of an algorithm
11 / 50
Which may be a stable sort?
12 / 50
Slow sorting algorithms run in,
13 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
14 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
15 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
16 / 50
Which may be stable sort:
17 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
18 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
19 / 50
In simple brute-force algorithm, we give no thought to efficiency.
20 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
21 / 50
Sorting can be in _________
22 / 50
Upper bound requires that there exist positive constants c2 and n0 such that f(n) ____ c2n for all n <= n0(ye question ghalat lag raha hai mujhae
23 / 50
The Knapsack problem belongs to the domain of _______________ problems.
24 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
25 / 50
In RAM model instructions are executed
26 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
27 / 50
Efficient algorithm requires less computational…….
28 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
29 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
30 / 50
Quick sort is best from the perspective of Locality of reference.
31 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
32 / 50
For the heap sort we store the tree nodes in
33 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
34 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
35 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
36 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
37 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
38 / 50
A RAM is an idealized machine with ______________ random-access memory.
39 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
40 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
41 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
42 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
43 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
44 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
45 / 50
Counting sort has time complexity:
46 / 50
47 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
48 / 50
Cont sort is suitable to sort the elements in range 1 to k
49 / 50
In ____________ we have to find rank of an element from given input.
50 / 50
______________ graphical representation of algorithm.
Your score is
The average score is 40%
Restart quiz
