CS502-Midterm
1 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
2 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
3 / 50
Quick sort is
4 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
5 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
6 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
7 / 50
In which order we can sort?
8 / 50
The Knapsack problem belongs to the domain of _______________ problems.
9 / 50
A RAM is an idealized machine with ______________ random-access memory.
10 / 50
The O-notation is used to state only the asymptotic ________bounds.
11 / 50
In Quick Sort Constants hidden in T(n log n) are
12 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
13 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
14 / 50
What is the total time to heapify?
15 / 50
Analysis of Selection algorithm ends up with,
16 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
17 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
18 / 50
Due to left complete nature of binary tree, the heap can be stored in
19 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
20 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
21 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
22 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
23 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
24 / 50
_______________ is a graphical representation of an algorithm
25 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
26 / 50
For the heap sort, access to nodes involves simple _______________ operations.
27 / 50
In RAM model instructions are executed
28 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
29 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
30 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
31 / 50
Sieve Technique can be applied to selection problem?
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
34 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
35 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
36 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
37 / 50
For the Sieve Technique we take time
38 / 50
Which may be stable sort:
39 / 50
In Sieve Technique we do not know which item is of interest
40 / 50
What type of instructions Random Access Machine (RAM) can execute?
41 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
42 / 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.
43 / 50
Divide-and-conquer as breaking the problem into a small number of
44 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
45 / 50
The sieve technique is a special case, where the number of sub problems is just
46 / 50
Efficient algorithm requires less computational…….
47 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
48 / 50
Algorithm is concerned with.......issues.
49 / 50
The sieve technique works in ___________ as follows
50 / 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.
Your score is
The average score is 40%
Restart quiz
