CS502-Midterm
1 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
2 / 50
For the heap sort, access to nodes involves simple _______________ operations.
3 / 50
Quick sort is
4 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
5 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
6 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
7 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
8 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
9 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
10 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
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
Is it possible to sort without making comparisons?
13 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
14 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
15 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
16 / 50
A RAM is an idealized machine with ______________ random-access memory.
17 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
18 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
19 / 50
The number of nodes in a complete binary tree of height h is
20 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
21 / 50
The Knapsack problem belongs to the domain of _______________ problems.
22 / 50
When we call heapify then at each level the comparison performed takes time
23 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
24 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
25 / 50
_______________ is a graphical representation of an algorithm
26 / 50
Random access machine or RAM is a/an
27 / 50
In Quick Sort Constants hidden in T(n log n) are
28 / 50
Which sorting algorithm is faster
29 / 50
In simple brute-force algorithm, we give no thought to efficiency.
30 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
31 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
32 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
33 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
34 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
35 / 50
Divide-and-conquer as breaking the problem into a small number of
36 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
37 / 50
The sieve technique is a special case, where the number of sub problems is just
38 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
39 / 50
In Sieve Technique we do not know which item is of interest
40 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
41 / 50
42 / 50
What is the total time to heapify?
43 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
44 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
45 / 50
46 / 50
Algorithm is concerned with.......issues.
47 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
48 / 50
In Heap Sort algorithm, if heap property is violated _________
49 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
50 / 50
For the sieve technique we solve the problem,
Your score is
The average score is 40%
Restart quiz
