CS502-Midterm
1 / 50
A heap is a left-complete binary tree that conforms to the ___________
2 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
3 / 50
In Quick Sort Constants hidden in T(n log n) are
4 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
5 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
6 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
7 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
8 / 50
How much time merge sort takes for an array of numbers?
9 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
10 / 50
The Knapsack problem belongs to the domain of _______________ problems.
11 / 50
Which may be a stable sort?
12 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
13 / 50
14 / 50
Divide-and-conquer as breaking the problem into a small number of
15 / 50
Quick sort is
16 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
17 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
18 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
19 / 50
The sieve technique works in ___________ as follows
20 / 50
Which sorting algorithm is faster
21 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
22 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
23 / 50
Due to left complete nature of binary tree, the heap can be stored in
24 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
25 / 50
In simple brute-force algorithm, we give no thought to efficiency.
26 / 50
A RAM is an idealized machine with ______________ random-access memory.
27 / 50
Algorithm is concerned with.......issues.
28 / 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.
29 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
30 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
31 / 50
_______________ is a graphical representation of an algorithm
32 / 50
When we call heapify then at each level the comparison performed takes time
33 / 50
Counting sort has time complexity:
34 / 50
In ____________ we have to find rank of an element from given input.
35 / 50
In Sieve Technique we do not know which item is of interest
36 / 50
The function f(n)= n(logn+1)/2 is asymptotically equivalent to n log n. Here Upper Bound means the function f(n) grows asymptotically ____________ faster than n log n.
37 / 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,
38 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
39 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
40 / 50
What is the total time to heapify?
41 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
42 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
43 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
44 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
45 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
46 / 50
What type of instructions Random Access Machine (RAM) can execute?
47 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
48 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
49 / 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.
50 / 50
Your score is
The average score is 40%
Restart quiz
