CS502-Midterm
1 / 50
A heap is a left-complete binary tree that conforms to the ___________
2 / 50
For the Sieve Technique we take time
3 / 50
What type of instructions Random Access Machine (RAM) can execute?
4 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
5 / 50
When we call heapify then at each level the comparison performed takes time
6 / 50
One example of in place but not stable algorithm is
7 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
8 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
9 / 50
Divide-and-conquer as breaking the problem into a small number of
10 / 50
Sieve Technique can be applied to selection problem?
11 / 50
The Knapsack problem belongs to the domain of _______________ problems.
12 / 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.
13 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
14 / 50
One Example of in place but not stable sort is
15 / 50
______________ graphical representation of algorithm.
16 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
17 / 50
Efficient algorithm requires less computational…….
18 / 50
44.The running time of an algorithm would not depend upon the optimization by the compiler but that of an implementation of the algorithm would depend on it.
19 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
20 / 50
The number of nodes in a complete binary tree of height h is
21 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
22 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
23 / 50
In which order we can sort?
24 / 50
In simple brute-force algorithm, we give no thought to efficiency.
25 / 50
In Heap Sort algorithm, if heap property is violated _________
26 / 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.
27 / 50
What is the total time to heapify?
28 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
29 / 50
Due to left complete nature of binary tree, the heap can be stored in
30 / 50
In Quick Sort Constants hidden in T(n log n) are
31 / 50
The sieve technique is a special case, where the number of sub problems is just
32 / 50
In RAM model instructions are executed
33 / 50
Sorting can be in _________
34 / 50
The running time of quick sort depends heavily on the selection of
35 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
36 / 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.
37 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
38 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
39 / 50
Quick sort is
40 / 50
Slow sorting algorithms run in,
41 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
42 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
43 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
44 / 50
45 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
46 / 50
Which may be a stable sort?
47 / 50
For the heap sort we store the tree nodes in
48 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
49 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
50 / 50
Is it possible to sort without making comparisons?
Your score is
The average score is 40%
Restart quiz
