CS502-Midterm
1 / 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.
2 / 50
What is the total time to heapify?
3 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
4 / 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.
5 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
6 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
7 / 50
When we call heapify then at each level the comparison performed takes time
8 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
9 / 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.
10 / 50
After sorting in merge sort algorithm, merging process is invoked.
11 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
12 / 50
Counting sort has time complexity:
13 / 50
14 / 50
In RAM model instructions are executed
15 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
16 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
17 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
18 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
19 / 50
Divide-and-conquer as breaking the problem into a small number of
20 / 50
Cont sort is suitable to sort the elements in range 1 to k
21 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
22 / 50
In simple brute-force algorithm, we give no thought to efficiency.
23 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
24 / 50
One example of in place but not stable algorithm is
25 / 50
In Heap Sort algorithm, if heap property is violated _________
26 / 50
_______________ is a graphical representation of an algorithm
27 / 50
One Example of in place but not stable sort is
28 / 50
In Sieve Technique we do not know which item is of interest
29 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
30 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
31 / 50
How much time merge sort takes for an array of numbers?
32 / 50
A heap is a left-complete binary tree that conforms to the ___________
33 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
34 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
35 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
36 / 50
A RAM is an idealized machine with ______________ random-access memory.
37 / 50
For the heap sort we store the tree nodes in
38 / 50
Analysis of Selection algorithm ends up with,
39 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
40 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
41 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
42 / 50
In Quick Sort Constants hidden in T(n log n) are
43 / 50
The function f(n)=n(logn+1)/2 is asymptotically equivalent to nlog n. Here Lower Bound means function f(n) grows asymptotically at ____________ as fast as nlog n.
44 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
45 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
46 / 50
47 / 50
Quick sort is best from the perspective of Locality of reference.
48 / 50
The sieve technique works in ___________ as follows
49 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
50 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
Your score is
The average score is 40%
Restart quiz
