CS502-Midterm
1 / 50
The sieve technique is a special case, where the number of sub problems is just
2 / 50
Analysis of Selection algorithm ends up with,
3 / 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.
4 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
5 / 50
In RAM model instructions are executed
6 / 50
A heap is a left-complete binary tree that conforms to the ___________
7 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
8 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
9 / 50
The number of nodes in a complete binary tree of height h is
10 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
11 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
12 / 50
In Sieve Technique we do not know which item is of interest
13 / 50
A RAM is an idealized machine with ______________ random-access memory.
14 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
15 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
16 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
17 / 50
One Example of in place but not stable sort is
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
For the Sieve Technique we take time
20 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
21 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
22 / 50
Slow sorting algorithms run in,
23 / 50
In simple brute-force algorithm, we give no thought to efficiency.
24 / 50
For the heap sort we store the tree nodes in
25 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
26 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
27 / 50
In Heap Sort algorithm, if heap property is violated _________
28 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
29 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
30 / 50
Due to left complete nature of binary tree, the heap can be stored in
31 / 50
Quick sort is best from the perspective of Locality of reference.
32 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
33 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
34 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
35 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
36 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
37 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
38 / 50
______________ graphical representation of algorithm.
39 / 50
After sorting in merge sort algorithm, merging process is invoked.
40 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
41 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
42 / 50
Which may be stable sort:
43 / 50
In Quick Sort Constants hidden in T(n log n) are
44 / 50
How much time merge sort takes for an array of numbers?
45 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
46 / 50
Quick sort is
47 / 50
Cont sort is suitable to sort the elements in range 1 to k
48 / 50
Which may be a stable sort?
49 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
50 / 50
What is the total time to heapify?
Your score is
The average score is 40%
Restart quiz
