CS502-Midterm
1 / 50
Slow sorting algorithms run in,
2 / 50
In Sieve Technique we do not know which item is of interest
3 / 50
Quick sort is
4 / 50
In RAM model instructions are executed
5 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
6 / 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.
7 / 50
Which may be stable sort:
8 / 50
For the heap sort we store the tree nodes in
9 / 50
In simple brute-force algorithm, we give no thought to efficiency.
10 / 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.
11 / 50
Due to left complete nature of binary tree, the heap can be stored in
12 / 50
In which order we can sort?
13 / 50
What is the total time to heapify?
14 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
15 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
16 / 50
The Knapsack problem belongs to the domain of _______________ problems.
17 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
18 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
19 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
20 / 50
21 / 50
The number of nodes in a complete binary tree of height h is
22 / 50
In Quick Sort Constants hidden in T(n log n) are
23 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
24 / 50
Which may be a stable sort?
25 / 50
One example of in place but not stable algorithm is
26 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
27 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
28 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
29 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
30 / 50
31 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
32 / 50
For the Sieve Technique we take time
33 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
34 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
35 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
36 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
37 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
38 / 50
Sorting can be in _________
39 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
40 / 50
Random access machine or RAM is a/an
41 / 50
42 / 50
How much time merge sort takes for an array of numbers?
43 / 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.
44 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
45 / 50
The sieve technique is a special case, where the number of sub problems is just
46 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
47 / 50
48 / 50
_______________ is a graphical representation of an algorithm
49 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
50 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
Your score is
The average score is 40%
Restart quiz
