CS502-Midterm
1 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
2 / 50
Which sorting algorithm is faster
3 / 50
What is the total time to heapify?
4 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
5 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
6 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
7 / 50
In simple brute-force algorithm, we give no thought to efficiency.
8 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
9 / 50
Divide-and-conquer as breaking the problem into a small number of
10 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
11 / 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.
12 / 50
One example of in place but not stable algorithm is
13 / 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.
14 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
15 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
16 / 50
_______________ is a graphical representation of an algorithm
17 / 50
The Knapsack problem belongs to the domain of _______________ problems.
18 / 50
Due to left complete nature of binary tree, the heap can be stored in
19 / 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
20 / 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.
21 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
22 / 50
23 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
24 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
25 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
26 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
27 / 50
When we call heapify then at each level the comparison performed takes time
28 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
29 / 50
Analysis of Selection algorithm ends up with,
30 / 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.
31 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
32 / 50
Efficient algorithm requires less computational…….
33 / 50
Quick sort is best from the perspective of Locality of reference.
34 / 50
Cont sort is suitable to sort the elements in range 1 to k
35 / 50
The running time of quick sort depends heavily on the selection of
36 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
37 / 50
In Sieve Technique we do not know which item is of interest
38 / 50
39 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
40 / 50
In Heap Sort algorithm, if heap property is violated _________
41 / 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,
42 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
43 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
44 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
45 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
46 / 50
In Quick Sort Constants hidden in T(n log n) are
47 / 50
How much time merge sort takes for an array of numbers?
48 / 50
______________ graphical representation of algorithm.
49 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
50 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
Your score is
The average score is 40%
Restart quiz
