CS502-Midterm
1 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
2 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
3 / 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.
4 / 50
For the sieve technique we solve the problem,
5 / 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.
6 / 50
After sorting in merge sort algorithm, merging process is invoked.
7 / 50
The running time of quick sort depends heavily on the selection of
8 / 50
In Sieve Technique we do not know which item is of interest
9 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
10 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
11 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
12 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
13 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
14 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
15 / 50
In simple brute-force algorithm, we give no thought to efficiency.
16 / 50
Sorting can be in _________
17 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
18 / 50
Which may be a stable sort?
19 / 50
A RAM is an idealized machine with ______________ random-access memory.
20 / 50
The sieve technique is a special case, where the number of sub problems is just
21 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
22 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
23 / 50
_______________ is a graphical representation of an algorithm
24 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
25 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
26 / 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
27 / 50
28 / 50
Quick sort is best from the perspective of Locality of reference.
29 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
30 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
31 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
32 / 50
Sieve Technique can be applied to selection problem?
33 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
34 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
35 / 50
How much time merge sort takes for an array of numbers?
36 / 50
Algorithm is concerned with.......issues.
37 / 50
One example of in place but not stable algorithm is
38 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
39 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
40 / 50
For the heap sort, access to nodes involves simple _______________ operations.
41 / 50
When we call heapify then at each level the comparison performed takes time
42 / 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.
43 / 50
The Knapsack problem belongs to the domain of _______________ problems.
44 / 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.
45 / 50
In Quick Sort Constants hidden in T(n log n) are
46 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
47 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
48 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
49 / 50
Which may be stable sort:
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
