CS502-Midterm
1 / 50
What type of instructions Random Access Machine (RAM) can execute?
2 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
3 / 50
In Quick Sort Constants hidden in T(n log n) are
4 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
5 / 50
Efficient algorithm requires less computational…….
6 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
7 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
8 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
9 / 50
The sieve technique works in ___________ as follows
10 / 50
Quick sort is
11 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
12 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
13 / 50
The Knapsack problem belongs to the domain of _______________ problems.
14 / 50
Slow sorting algorithms run in,
15 / 50
A RAM is an idealized machine with ______________ random-access memory.
16 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
17 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
18 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
19 / 50
Due to left complete nature of binary tree, the heap can be stored in
20 / 50
For the heap sort we store the tree nodes in
21 / 50
Divide-and-conquer as breaking the problem into a small number of
22 / 50
In Heap Sort algorithm, if heap property is violated _________
23 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
24 / 50
25 / 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,
26 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
27 / 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.
28 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
29 / 50
After sorting in merge sort algorithm, merging process is invoked.
30 / 50
In Sieve Technique we do not know which item is of interest
31 / 50
Sieve Technique can be applied to selection problem?
32 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
33 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
34 / 50
35 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
36 / 50
The O-notation is used to state only the asymptotic ________bounds.
37 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
38 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
39 / 50
One Example of in place but not stable sort is
40 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
41 / 50
For the worst-case running time analysis, the nested loop structure containing one “for” and one “while” loop, might be expressed as a pair of _________nested summations.
42 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
43 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
44 / 50
Counting sort has time complexity:
45 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
46 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
47 / 50
One example of in place but not stable algorithm is
48 / 50
In simple brute-force algorithm, we give no thought to efficiency.
49 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
50 / 50
The sieve technique is a special case, where the number of sub problems is just
Your score is
The average score is 40%
Restart quiz
