CS502-Midterm
1 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
2 / 50
When we call heapify then at each level the comparison performed takes time
3 / 50
The running time of quick sort depends heavily on the selection of
4 / 50
In which order we can sort?
5 / 50
What is the total time to heapify?
6 / 50
In Quick Sort Constants hidden in T(n log n) are
7 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
8 / 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,
9 / 50
A RAM is an idealized machine with ______________ random-access memory.
10 / 50
The sieve technique works in ___________ as follows
11 / 50
For the heap sort, access to nodes involves simple _______________ operations.
12 / 50
How much time merge sort takes for an array of numbers?
13 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
14 / 50
15 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
16 / 50
Due to left complete nature of binary tree, the heap can be stored in
17 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
18 / 50
After sorting in merge sort algorithm, merging process is invoked.
19 / 50
Cont sort is suitable to sort the elements in range 1 to k
20 / 50
In RAM model instructions are executed
21 / 50
In Heap Sort algorithm, if heap property is violated _________
22 / 50
For the heap sort we store the tree nodes in
23 / 50
The sieve technique is a special case, where the number of sub problems is just
24 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
25 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
26 / 50
The Knapsack problem belongs to the domain of _______________ problems.
27 / 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
28 / 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.
29 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
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
Analysis of Selection algorithm ends up with,
32 / 50
The O-notation is used to state only the asymptotic ________bounds.
33 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
34 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
35 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
36 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
37 / 50
Counting sort has time complexity:
38 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
39 / 50
A heap is a left-complete binary tree that conforms to the ___________
40 / 50
Is it possible to sort without making comparisons?
41 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
42 / 50
Which may be stable sort:
43 / 50
44 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
45 / 50
One Example of in place but not stable sort is
46 / 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.
47 / 50
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
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
50 / 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.
Your score is
The average score is 40%
Restart quiz
