CS502-Midterm
1 / 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.
2 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
3 / 50
The O-notation is used to state only the asymptotic ________bounds.
4 / 50
For the heap sort, access to nodes involves simple _______________ operations.
5 / 50
Upper bound requires that there exist positive constants c2 and n0 such that f(n) ____ c2n for all n <= n0(ye question ghalat lag raha hai mujhae
6 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
7 / 50
Slow sorting algorithms run in,
8 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
9 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
10 / 50
For the Sieve Technique we take time
11 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
12 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
13 / 50
What type of instructions Random Access Machine (RAM) can execute?
14 / 50
In Quick Sort Constants hidden in T(n log n) are
15 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
16 / 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,
17 / 50
Efficient algorithm requires less computational…….
18 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
19 / 50
When we call heapify then at each level the comparison performed takes time
20 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
21 / 50
What is the total time to heapify?
22 / 50
The number of nodes in a complete binary tree of height h is
23 / 50
Which may be a stable sort?
24 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
25 / 50
Quick sort is
26 / 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.
27 / 50
_______________ is a graphical representation of an algorithm
28 / 50
29 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
30 / 50
In Heap Sort algorithm, if heap property is violated _________
31 / 50
The sieve technique works in ___________ as follows
32 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
33 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
34 / 50
Quick sort is best from the perspective of Locality of reference.
35 / 50
36 / 50
After sorting in merge sort algorithm, merging process is invoked.
37 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
38 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
39 / 50
Due to left complete nature of binary tree, the heap can be stored in
40 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
41 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
42 / 50
The Knapsack problem belongs to the domain of _______________ problems.
43 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
44 / 50
In RAM model instructions are executed
45 / 50
Cont sort is suitable to sort the elements in range 1 to k
46 / 50
The sieve technique is a special case, where the number of sub problems is just
47 / 50
Analysis of Selection algorithm ends up with,
48 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
49 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
50 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
Your score is
The average score is 40%
Restart quiz
