CS502-Midterm
1 / 50
The number of nodes in a complete binary tree of height h is
2 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
3 / 50
Due to left complete nature of binary tree, the heap can be stored in
4 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
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
For Chain Matrix Multiplication we can not use divide and conquer approach because,
7 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
8 / 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
9 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
10 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
11 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
12 / 50
The running time of quick sort depends heavily on the selection of
13 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
14 / 50
For the Sieve Technique we take time
15 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
16 / 50
17 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
18 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
19 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
20 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
21 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
22 / 50
In simple brute-force algorithm, we give no thought to efficiency.
23 / 50
Is it possible to sort without making comparisons?
24 / 50
Analysis of Selection algorithm ends up with,
25 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
26 / 50
If we associate (x, y) integers pair to cars where x is the speed of the car and y is the negation of the price. High y value for a car means a ________ car.
27 / 50
In Heap Sort algorithm, if heap property is violated _________
28 / 50
After sorting in merge sort algorithm, merging process is invoked.
29 / 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,
30 / 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.
31 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
32 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
33 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
34 / 50
The sieve technique works in ___________ as follows
35 / 50
______________ graphical representation of algorithm.
36 / 50
What type of instructions Random Access Machine (RAM) can execute?
37 / 50
A heap is a left-complete binary tree that conforms to the ___________
38 / 50
For the heap sort, access to nodes involves simple _______________ operations.
39 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
40 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
41 / 50
Quick sort is
42 / 50
What is the total time to heapify?
43 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
44 / 50
Divide-and-conquer as breaking the problem into a small number of
45 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
46 / 50
The O-notation is used to state only the asymptotic ________bounds.
47 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
48 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
49 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
50 / 50
Which sorting algorithm is faster
Your score is
The average score is 40%
Restart quiz
