CS502-Midterm
1 / 50
______________ graphical representation of algorithm.
2 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
3 / 50
What is the total time to heapify?
4 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
5 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
6 / 50
Due to left complete nature of binary tree, the heap can be stored in
7 / 50
Sorting can be in _________
8 / 50
In Heap Sort algorithm, if heap property is violated _________
9 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
10 / 50
In Quick Sort Constants hidden in T(n log n) are
11 / 50
In Sieve Technique we do not know which item is of interest
12 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
13 / 50
What type of instructions Random Access Machine (RAM) can execute?
14 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
15 / 50
The sieve technique is a special case, where the number of sub problems is just
16 / 50
_______________ is a graphical representation of an algorithm
17 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
18 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
19 / 50
In which order we can sort?
20 / 50
Quick sort is
21 / 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.
22 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
23 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
24 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
25 / 50
The number of nodes in a complete binary tree of height h is
26 / 50
Cont sort is suitable to sort the elements in range 1 to k
27 / 50
Analysis of Selection algorithm ends up with,
28 / 50
Random access machine or RAM is a/an
29 / 50
Which may be a stable sort?
30 / 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.
31 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
32 / 50
The sieve technique works in ___________ as follows
33 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
34 / 50
For the Sieve Technique we take time
35 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
36 / 50
37 / 50
In RAM model instructions are executed
38 / 50
When we call heapify then at each level the comparison performed takes time
39 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
40 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
41 / 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.
42 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
43 / 50
44 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
45 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
46 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
47 / 50
48 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
49 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
50 / 50
Efficient algorithm requires less computational…….
Your score is
The average score is 40%
Restart quiz
