CS502-Midterm
1 / 50
Counting sort has time complexity:
2 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
3 / 50
Efficient algorithm requires less computational…….
4 / 50
In Sieve Technique we do not know which item is of interest
5 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
6 / 50
Random access machine or RAM is a/an
7 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
8 / 50
______________ graphical representation of algorithm.
9 / 50
Sorting can be in _________
10 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
11 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
12 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
13 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
14 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
15 / 50
16 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
17 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
18 / 50
What is the total time to heapify?
19 / 50
20 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
21 / 50
Due to left complete nature of binary tree, the heap can be stored in
22 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
23 / 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.
24 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
25 / 50
The sieve technique works in ___________ as follows
26 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
27 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
28 / 50
In Quick Sort Constants hidden in T(n log n) are
29 / 50
Which may be stable sort:
30 / 50
How much time merge sort takes for an array of numbers?
31 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
32 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
33 / 50
For the heap sort, access to nodes involves simple _______________ operations.
34 / 50
The number of nodes in a complete binary tree of height h is
35 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
36 / 50
When we call heapify then at each level the comparison performed takes time
37 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
38 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
39 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
40 / 50
For the heap sort we store the tree nodes in
41 / 50
Algorithm is concerned with.......issues.
42 / 50
Is it possible to sort without making comparisons?
43 / 50
After sorting in merge sort algorithm, merging process is invoked.
44 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
45 / 50
For the sieve technique we solve the problem,
46 / 50
In simple brute-force algorithm, we give no thought to efficiency.
47 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
48 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
49 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
50 / 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.
Your score is
The average score is 40%
Restart quiz
