CS502-Midterm
1 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
2 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
3 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
4 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
5 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
6 / 50
In Sieve Technique we do not know which item is of interest
7 / 50
Due to left complete nature of binary tree, the heap can be stored in
8 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
9 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
10 / 50
Quick sort is best from the perspective of Locality of reference.
11 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
12 / 50
13 / 50
Slow sorting algorithms run in,
14 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
15 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
16 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
17 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
18 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
19 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
20 / 50
What type of instructions Random Access Machine (RAM) can execute?
21 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
22 / 50
The sieve technique is a special case, where the number of sub problems is just
23 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
24 / 50
In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis,
25 / 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.
26 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
27 / 50
After sorting in merge sort algorithm, merging process is invoked.
28 / 50
For the sieve technique we solve the problem,
29 / 50
30 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
31 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
32 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
33 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
34 / 50
For the heap sort we store the tree nodes in
35 / 50
What is the total time to heapify?
36 / 50
Is it possible to sort without making comparisons?
37 / 50
_______________ is a graphical representation of an algorithm
38 / 50
The number of nodes in a complete binary tree of height h is
39 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
40 / 50
Which sorting algorithm is faster
41 / 50
In plane sweep approach, a vertical line is swept across the 2d-plane and _______structure is used for holding the maximal points lying to the left of the sweep line.
42 / 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
43 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
44 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
45 / 50
A RAM is an idealized machine with ______________ random-access memory.
46 / 50
The O-notation is used to state only the asymptotic ________bounds.
47 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
48 / 50
For the heap sort, access to nodes involves simple _______________ operations.
49 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
50 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
Your score is
The average score is 40%
Restart quiz
