CS502-Midterm
1 / 50
For the heap sort, access to nodes involves simple _______________ operations.
2 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
3 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
4 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
5 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
6 / 50
For the heap sort we store the tree nodes in
7 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
8 / 50
In simple brute-force algorithm, we give no thought to efficiency.
9 / 50
Cont sort is suitable to sort the elements in range 1 to k
10 / 50
Sorting can be in _________
11 / 50
Counting sort has time complexity:
12 / 50
Divide-and-conquer as breaking the problem into a small number of
13 / 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
14 / 50
Sieve Technique can be applied to selection problem?
15 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
16 / 50
Is it possible to sort without making comparisons?
17 / 50
The running time of quick sort depends heavily on the selection of
18 / 50
Analysis of Selection algorithm ends up with,
19 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
20 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
21 / 50
Efficient algorithm requires less computational…….
22 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
23 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
24 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
25 / 50
Quick sort is
26 / 50
27 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
28 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
29 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
30 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
31 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
32 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
33 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
34 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
35 / 50
Algorithm is concerned with.......issues.
36 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
37 / 50
38 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
39 / 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.
40 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
41 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
42 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
43 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
44 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
45 / 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.
46 / 50
When we call heapify then at each level the comparison performed takes time
47 / 50
Which sorting algorithm is faster
48 / 50
49 / 50
In Quick Sort Constants hidden in T(n log n) are
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
