CS502-Midterm
1 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
2 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
3 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
4 / 50
Which sorting algorithm is faster
5 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
6 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
7 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
8 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
9 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
10 / 50
The sieve technique works in ___________ as follows
11 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
12 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
13 / 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.
14 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
15 / 50
In RAM model instructions are executed
16 / 50
In Heap Sort algorithm, if heap property is violated _________
17 / 50
The sieve technique is a special case, where the number of sub problems is just
18 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
19 / 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.
20 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
21 / 50
The Knapsack problem belongs to the domain of _______________ problems.
22 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
23 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
24 / 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.
25 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
26 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
27 / 50
Analysis of Selection algorithm ends up with,
28 / 50
In Sieve Technique we do not know which item is of interest
29 / 50
Cont sort is suitable to sort the elements in range 1 to k
30 / 50
Due to left complete nature of binary tree, the heap can be stored in
31 / 50
Efficient algorithm requires less computational…….
32 / 50
For the heap sort we store the tree nodes in
33 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
34 / 50
Quick sort is
35 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
36 / 50
Slow sorting algorithms run in,
37 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
38 / 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
39 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
40 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
41 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
42 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
43 / 50
A heap is a left-complete binary tree that conforms to the ___________
44 / 50
When we call heapify then at each level the comparison performed takes time
45 / 50
One example of in place but not stable algorithm is
46 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
47 / 50
______________ graphical representation of algorithm.
48 / 50
49 / 50
What is the total time to heapify?
50 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
Your score is
The average score is 40%
Restart quiz
