CS502-Midterm
1 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
2 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
3 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
4 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
5 / 50
Divide-and-conquer as breaking the problem into a small number of
6 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
7 / 50
For the Sieve Technique we take time
8 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
9 / 50
For the sieve technique we solve the problem,
10 / 50
The O-notation is used to state only the asymptotic ________bounds.
11 / 50
In Sieve Technique we do not know which item is of interest
12 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
13 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
14 / 50
The sieve technique works in ___________ as follows
15 / 50
In ____________ we have to find rank of an element from given input.
16 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
17 / 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.
18 / 50
After sorting in merge sort algorithm, merging process is invoked.
19 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
20 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
21 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
22 / 50
One Example of in place but not stable sort is
23 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
24 / 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.
25 / 50
26 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
27 / 50
Which may be a stable sort?
28 / 50
______________ graphical representation of algorithm.
29 / 50
How much time merge sort takes for an array of numbers?
30 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
31 / 50
A heap is a left-complete binary tree that conforms to the ___________
32 / 50
Which sorting algorithm is faster
33 / 50
34 / 50
Sorting can be in _________
35 / 50
_______________ is a graphical representation of an algorithm
36 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
37 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
38 / 50
For the heap sort, access to nodes involves simple _______________ operations.
39 / 50
In Heap Sort algorithm, if heap property is violated _________
40 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
41 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
42 / 50
Analysis of Selection algorithm ends up with,
43 / 50
The Knapsack problem belongs to the domain of _______________ problems.
44 / 50
When we call heapify then at each level the comparison performed takes time
45 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
46 / 50
Sieve Technique can be applied to selection problem?
47 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
48 / 50
What is the total time to heapify?
49 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
50 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
Your score is
The average score is 40%
Restart quiz
