CS502-Midterm
1 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
2 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
3 / 50
Random access machine or RAM is a/an
4 / 50
Quick sort is best from the perspective of Locality of reference.
5 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
6 / 50
In which order we can sort?
7 / 50
After sorting in merge sort algorithm, merging process is invoked.
8 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
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 Chain Matrix Multiplication we can not use divide and conquer approach because,
11 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
12 / 50
The sieve technique works in ___________ as follows
13 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
14 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
15 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
16 / 50
In Quick Sort Constants hidden in T(n log n) are
17 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
18 / 50
What type of instructions Random Access Machine (RAM) can execute?
19 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
20 / 50
______________ graphical representation of algorithm.
21 / 50
In ____________ we have to find rank of an element from given input.
22 / 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.
23 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
24 / 50
For the Sieve Technique we take time
25 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
26 / 50
The sieve technique is a special case, where the number of sub problems is just
27 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
28 / 50
Which may be stable sort:
29 / 50
_______________ is a graphical representation of an algorithm
30 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
31 / 50
Quick sort is
32 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
33 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
34 / 50
Divide-and-conquer as breaking the problem into a small number of
35 / 50
For the heap sort, access to nodes involves simple _______________ operations.
36 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
37 / 50
When we call heapify then at each level the comparison performed takes time
38 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
39 / 50
In RAM model instructions are executed
40 / 50
How much time merge sort takes for an array of numbers?
41 / 50
The number of nodes in a complete binary tree of height h is
42 / 50
Consider the following code:
For(j=1; j
For(k=1; k<15;k++)
For(l=5; l
{
Do_something_constant();
}
What is the order of execution for this code.
43 / 50
Efficient algorithm requires less computational…….
44 / 50
For the heap sort we store the tree nodes in
45 / 50
46 / 50
Algorithm is concerned with.......issues.
47 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
48 / 50
Which may be a stable sort?
49 / 50
Which sorting algorithm is faster
50 / 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.
Your score is
The average score is 40%
Restart quiz
