CS502-Midterm
1 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
2 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
3 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
4 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
5 / 50
Cont sort is suitable to sort the elements in range 1 to k
6 / 50
The running time of quick sort depends heavily on the selection of
7 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
8 / 50
For the heap sort we store the tree nodes in
9 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
10 / 50
Analysis of Selection algorithm ends up with,
11 / 50
What type of instructions Random Access Machine (RAM) can execute?
12 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
13 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
14 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
15 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
16 / 50
17 / 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.
18 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
19 / 50
Counting sort has time complexity:
20 / 50
The number of nodes in a complete binary tree of height h is
21 / 50
A RAM is an idealized machine with ______________ random-access memory.
22 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
23 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
24 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
25 / 50
For the Sieve Technique we take time
26 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
27 / 50
In RAM model instructions are executed
28 / 50
In which order we can sort?
29 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
30 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
31 / 50
The function f(n)=n(logn+1)/2 is asymptotically equivalent to nlog n. Here Lower Bound means function f(n) grows asymptotically at ____________ as fast as nlog n.
32 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
33 / 50
Quick sort is
34 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
35 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
36 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
37 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
38 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
39 / 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
40 / 50
The function f(n)= n(logn+1)/2 is asymptotically equivalent to n log n. Here Upper Bound means the function f(n) grows asymptotically ____________ faster than n log n.
41 / 50
_______________ is a graphical representation of an algorithm
42 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
43 / 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.
44 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
45 / 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.
46 / 50
What is the total time to heapify?
47 / 50
Divide-and-conquer as breaking the problem into a small number of
48 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
49 / 50
In ____________ we have to find rank of an element from given input.
50 / 50
Random access machine or RAM is a/an
Your score is
The average score is 40%
Restart quiz
