CS502-Midterm
1 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
2 / 50
What is the total time to heapify?
3 / 50
Random access machine or RAM is a/an
4 / 50
In simple brute-force algorithm, we give no thought to efficiency.
5 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
6 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
7 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
8 / 50
For the Sieve Technique we take time
9 / 50
10 / 50
Analysis of Selection algorithm ends up with,
11 / 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.
12 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
13 / 50
Is it possible to sort without making comparisons?
14 / 50
For the heap sort, access to nodes involves simple _______________ operations.
15 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
16 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
17 / 50
How much time merge sort takes for an array of numbers?
18 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
19 / 50
Counting sort has time complexity:
20 / 50
Which may be a stable sort?
21 / 50
Which may be stable sort:
22 / 50
After sorting in merge sort algorithm, merging process is invoked.
23 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
24 / 50
In Quick Sort Constants hidden in T(n log n) are
25 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
26 / 50
The Knapsack problem belongs to the domain of _______________ problems.
27 / 50
In Sieve Technique we do not know which item is of interest
28 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
29 / 50
The sieve technique is a special case, where the number of sub problems is just
30 / 50
Which sorting algorithm is faster
31 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
32 / 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.
33 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
34 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
35 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
36 / 50
37 / 50
38 / 50
When we call heapify then at each level the comparison performed takes time
39 / 50
In Heap Sort algorithm, if heap property is violated _________
40 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
41 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
42 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
43 / 50
For the heap sort we store the tree nodes in
44 / 50
_______________ is a graphical representation of an algorithm
45 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
46 / 50
The sieve technique works in ___________ as follows
47 / 50
Algorithm is concerned with.......issues.
48 / 50
49 / 50
Sieve Technique can be applied to selection problem?
50 / 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.
Your score is
The average score is 40%
Restart quiz
