CS502-Midterm
1 / 50
What is the total time to heapify?
2 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
3 / 50
The Knapsack problem belongs to the domain of _______________ problems.
4 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
5 / 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
6 / 50
Slow sorting algorithms run in,
7 / 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.
8 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
9 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
10 / 50
After sorting in merge sort algorithm, merging process is invoked.
11 / 50
What type of instructions Random Access Machine (RAM) can execute?
12 / 50
In Sieve Technique we do not know which item is of interest
13 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
14 / 50
_______________ is a graphical representation of an algorithm
15 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
16 / 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.
17 / 50
For the Sieve Technique we take time
18 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
19 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
20 / 50
Which sorting algorithm is faster
21 / 50
Cont sort is suitable to sort the elements in range 1 to k
22 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
23 / 50
For the heap sort, access to nodes involves simple _______________ operations.
24 / 50
In Quick Sort Constants hidden in T(n log n) are
25 / 50
Efficient algorithm requires less computational…….
26 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
27 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
28 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
29 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
30 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
31 / 50
The sieve technique is a special case, where the number of sub problems is just
32 / 50
The O-notation is used to state only the asymptotic ________bounds.
33 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
34 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
35 / 50
36 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
37 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
38 / 50
Which may be stable sort:
39 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
40 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
41 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
42 / 50
In ____________ we have to find rank of an element from given input.
43 / 50
Due to left complete nature of binary tree, the heap can be stored in
44 / 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.
45 / 50
In which order we can sort?
46 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
47 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
48 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
49 / 50
For the heap sort we store the tree nodes in
50 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
Your score is
The average score is 40%
Restart quiz
