CS502-Midterm
1 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
2 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
3 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
4 / 50
Which may be stable sort:
5 / 50
Is it possible to sort without making comparisons?
6 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
7 / 50
In ____________ we have to find rank of an element from given input.
8 / 50
Sorting can be in _________
9 / 50
In Quick Sort Constants hidden in T(n log n) are
10 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
11 / 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.
12 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
13 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
14 / 50
Counting sort has time complexity:
15 / 50
Random access machine or RAM is a/an
16 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
17 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
18 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
19 / 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.
20 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
21 / 50
For the Sieve Technique we take time
22 / 50
The number of nodes in a complete binary tree of height h is
23 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
24 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
25 / 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.
26 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
27 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
28 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
29 / 50
Divide-and-conquer as breaking the problem into a small number of
30 / 50
Which sorting algorithm is faster
31 / 50
In RAM model instructions are executed
32 / 50
Analysis of Selection algorithm ends up with,
33 / 50
What type of instructions Random Access Machine (RAM) can execute?
34 / 50
How much time merge sort takes for an array of numbers?
35 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
36 / 50
The O-notation is used to state only the asymptotic ________bounds.
37 / 50
Slow sorting algorithms run in,
38 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
39 / 50
A heap is a left-complete binary tree that conforms to the ___________
40 / 50
Due to left complete nature of binary tree, the heap can be stored in
41 / 50
42 / 50
Quick sort is best from the perspective of Locality of reference.
43 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
44 / 50
In Sieve Technique we do not know which item is of interest
45 / 50
What is the total time to heapify?
46 / 50
Efficient algorithm requires less computational…….
47 / 50
The sieve technique is a special case, where the number of sub problems is just
48 / 50
49 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
50 / 50
Sieve Technique can be applied to selection problem?
Your score is
The average score is 40%
Restart quiz
