CS502-Midterm
1 / 50
One Example of in place but not stable sort is
2 / 50
In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis,
3 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
4 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
5 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
6 / 50
Due to left complete nature of binary tree, the heap can be stored in
7 / 50
In Quick Sort Constants hidden in T(n log n) are
8 / 50
Which may be stable sort:
9 / 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.
10 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
11 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
12 / 50
The running time of quick sort depends heavily on the selection of
13 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
14 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
15 / 50
The number of nodes in a complete binary tree of height h is
16 / 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.
17 / 50
_______________ is a graphical representation of an algorithm
18 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
19 / 50
The sieve technique works in ___________ as follows
20 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
21 / 50
What type of instructions Random Access Machine (RAM) can execute?
22 / 50
Sieve Technique can be applied to selection problem?
23 / 50
How much time merge sort takes for an array of numbers?
24 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
25 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
26 / 50
In Heap Sort algorithm, if heap property is violated _________
27 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
28 / 50
Efficient algorithm requires less computational…….
29 / 50
Which may be a stable sort?
30 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
31 / 50
Divide-and-conquer as breaking the problem into a small number of
32 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
33 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
34 / 50
35 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
36 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
37 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
38 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
39 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
40 / 50
For the Sieve Technique we take time
41 / 50
In RAM model instructions are executed
42 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
43 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
44 / 50
The O-notation is used to state only the asymptotic ________bounds.
45 / 50
For the heap sort we store the tree nodes in
46 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
47 / 50
48 / 50
In simple brute-force algorithm, we give no thought to efficiency.
49 / 50
In Sieve Technique we do not know which item is of interest
50 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
Your score is
The average score is 40%
Restart quiz
