CS502-Midterm
1 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
2 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
3 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
4 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
5 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
6 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
7 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
8 / 50
Efficient algorithm requires less computational…….
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
The number of nodes in a complete binary tree of height h is
11 / 50
In Heap Sort algorithm, if heap property is violated _________
12 / 50
Quick sort is
13 / 50
For the Sieve Technique we take time
14 / 50
In which order we can sort?
15 / 50
The O-notation is used to state only the asymptotic ________bounds.
16 / 50
A heap is a left-complete binary tree that conforms to the ___________
17 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
18 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
19 / 50
For the heap sort we store the tree nodes in
20 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
21 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
22 / 50
In plane sweep approach, a vertical line is swept across the 2d-plane and _______structure is used for holding the maximal points lying to the left of the sweep line.
23 / 50
Analysis of Selection algorithm ends up with,
24 / 50
In simple brute-force algorithm, we give no thought to efficiency.
25 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
26 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
27 / 50
What is the total time to heapify?
28 / 50
Which may be a stable sort?
29 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
30 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
31 / 50
One Example of in place but not stable sort is
32 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
33 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
34 / 50
Algorithm is concerned with.......issues.
35 / 50
36 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
37 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
38 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
39 / 50
Due to left complete nature of binary tree, the heap can be stored in
40 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
41 / 50
What type of instructions Random Access Machine (RAM) can execute?
42 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
43 / 50
When we call heapify then at each level the comparison performed takes time
44 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
45 / 50
In ____________ we have to find rank of an element from given input.
46 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
47 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
48 / 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.
49 / 50
Slow sorting algorithms run in,
50 / 50
In Quick Sort Constants hidden in T(n log n) are
Your score is
The average score is 40%
Restart quiz
