CS502-Midterm
1 / 50
The sieve technique is a special case, where the number of sub problems is just
2 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
3 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
4 / 50
Slow sorting algorithms run in,
5 / 50
What is the total time to heapify?
6 / 50
Which may be stable sort:
7 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
8 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
9 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
10 / 50
Quick sort is best from the perspective of Locality of reference.
11 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
12 / 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.
13 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
14 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
15 / 50
How much time merge sort takes for an array of numbers?
16 / 50
For the Sieve Technique we take time
17 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
18 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
19 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
20 / 50
In ____________ we have to find rank of an element from given input.
21 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
22 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
23 / 50
Divide-and-conquer as breaking the problem into a small number of
24 / 50
In Sieve Technique we do not know which item is of interest
25 / 50
For the heap sort, access to nodes involves simple _______________ operations.
26 / 50
Which may be a stable sort?
27 / 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.
28 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
29 / 50
______________ graphical representation of algorithm.
30 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
31 / 50
In which order we can sort?
32 / 50
For the heap sort we store the tree nodes in
33 / 50
Sieve Technique can be applied to selection problem?
34 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
35 / 50
Algorithm is concerned with.......issues.
36 / 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.
37 / 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.
38 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
39 / 50
One example of in place but not stable algorithm is
40 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
41 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
42 / 50
_______________ is a graphical representation of an algorithm
43 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
44 / 50
In Quick Sort Constants hidden in T(n log n) are
45 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
46 / 50
47 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
48 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
49 / 50
Which sorting algorithm is faster
50 / 50
Your score is
The average score is 40%
Restart quiz
