CS502-Midterm
1 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
2 / 50
The number of nodes in a complete binary tree of height h is
3 / 50
Cont sort is suitable to sort the elements in range 1 to k
4 / 50
Analysis of Selection algorithm ends up with,
5 / 50
Efficient algorithm requires less computational…….
6 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
7 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
8 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
9 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
10 / 50
For the heap sort we store the tree nodes in
11 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
12 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
13 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
14 / 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.
15 / 50
In Sieve Technique we do not know which item is of interest
16 / 50
Slow sorting algorithms run in,
17 / 50
A RAM is an idealized machine with ______________ random-access memory.
18 / 50
Which may be a stable sort?
19 / 50
In Heap Sort algorithm, if heap property is violated _________
20 / 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,
21 / 50
Which sorting algorithm is faster
22 / 50
Sorting can be in _________
23 / 50
In Quick Sort Constants hidden in T(n log n) are
24 / 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.
25 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
26 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
27 / 50
A heap is a left-complete binary tree that conforms to the ___________
28 / 50
Quick sort is
29 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
30 / 50
Quick sort is best from the perspective of Locality of reference.
31 / 50
What is the total time to heapify?
32 / 50
After sorting in merge sort algorithm, merging process is invoked.
33 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
34 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
35 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
36 / 50
In which order we can sort?
37 / 50
How much time merge sort takes for an array of numbers?
38 / 50
39 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
40 / 50
Is it possible to sort without making comparisons?
41 / 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
42 / 50
Random access machine or RAM is a/an
43 / 50
Sieve Technique can be applied to selection problem?
44 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
45 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
46 / 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.
47 / 50
For the Sieve Technique we take time
48 / 50
Counting sort has time complexity:
49 / 50
50 / 50
The running time of quick sort depends heavily on the selection of
Your score is
The average score is 40%
Restart quiz
