CS502-Midterm
1 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
2 / 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.
3 / 50
What is the total time to heapify?
4 / 50
One Example of in place but not stable sort is
5 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
6 / 50
The number of nodes in a complete binary tree of height h is
7 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
8 / 50
Counting sort has time complexity:
9 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
10 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
11 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
12 / 50
After sorting in merge sort algorithm, merging process is invoked.
13 / 50
The O-notation is used to state only the asymptotic ________bounds.
14 / 50
Which sorting algorithm is faster
15 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
16 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
17 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
18 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
19 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
20 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
21 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
22 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
23 / 50
In Sieve Technique we do not know which item is of interest
24 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
25 / 50
In simple brute-force algorithm, we give no thought to efficiency.
26 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
27 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
28 / 50
For the sieve technique we solve the problem,
29 / 50
30 / 50
A heap is a left-complete binary tree that conforms to the ___________
31 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
32 / 50
In Quick Sort Constants hidden in T(n log n) are
33 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
34 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
35 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
36 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
37 / 50
What type of instructions Random Access Machine (RAM) can execute?
38 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
39 / 50
A RAM is an idealized machine with ______________ random-access memory.
40 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
41 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
42 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
43 / 50
Quick sort is best from the perspective of Locality of reference.
44 / 50
Cont sort is suitable to sort the elements in range 1 to k
45 / 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.
46 / 50
47 / 50
In which order we can sort?
48 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
49 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
50 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
Your score is
The average score is 40%
Restart quiz
