CS502-Midterm
1 / 50
Quick sort is
2 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
3 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
4 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
5 / 50
Which may be a stable sort?
6 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
7 / 50
In Quick Sort Constants hidden in T(n log n) are
8 / 50
Algorithm is concerned with.......issues.
9 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
10 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
11 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
12 / 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.
13 / 50
Due to left complete nature of binary tree, the heap can be stored in
14 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
15 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
16 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
17 / 50
Slow sorting algorithms run in,
18 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
19 / 50
In Sieve Technique we do not know which item is of interest
20 / 50
Divide-and-conquer as breaking the problem into a small number of
21 / 50
The Knapsack problem belongs to the domain of _______________ problems.
22 / 50
The running time of quick sort depends heavily on the selection of
23 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
24 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
25 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
26 / 50
Counting sort has time complexity:
27 / 50
The sieve technique is a special case, where the number of sub problems is just
28 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
29 / 50
What type of instructions Random Access Machine (RAM) can execute?
30 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
31 / 50
Sieve Technique can be applied to selection problem?
32 / 50
Which sorting algorithm is faster
33 / 50
When we call heapify then at each level the comparison performed takes time
34 / 50
How much time merge sort takes for an array of numbers?
35 / 50
In RAM model instructions are executed
36 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
37 / 50
Is it possible to sort without making comparisons?
38 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
39 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
40 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
41 / 50
For the Sieve Technique we take time
42 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
43 / 50
The O-notation is used to state only the asymptotic ________bounds.
44 / 50
After sorting in merge sort algorithm, merging process is invoked.
45 / 50
46 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
47 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
48 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
49 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
50 / 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,
Your score is
The average score is 40%
Restart quiz
