CS502-Midterm
1 / 50
One example of in place but not stable algorithm is
2 / 50
The Knapsack problem belongs to the domain of _______________ problems.
3 / 50
In Heap Sort algorithm, if heap property is violated _________
4 / 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.
5 / 50
In ____________ we have to find rank of an element from given input.
6 / 50
The running time of quick sort depends heavily on the selection of
7 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
8 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
9 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
10 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
11 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
12 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
13 / 50
In Quick Sort Constants hidden in T(n log n) are
14 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
15 / 50
16 / 50
______________ graphical representation of algorithm.
17 / 50
Efficient algorithm requires less computational…….
18 / 50
Analysis of Selection algorithm ends up with,
19 / 50
One Example of in place but not stable sort is
20 / 50
Which may be a stable sort?
21 / 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.
22 / 50
Counting sort has time complexity:
23 / 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.
24 / 50
Which sorting algorithm is faster
25 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
26 / 50
For the heap sort, access to nodes involves simple _______________ operations.
27 / 50
In Sieve Technique we do not know which item is of interest
28 / 50
For the Sieve Technique we take time
29 / 50
Sieve Technique can be applied to selection problem?
30 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
31 / 50
Divide-and-conquer as breaking the problem into a small number of
32 / 50
After sorting in merge sort algorithm, merging process is invoked.
33 / 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.
34 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
35 / 50
36 / 50
Random access machine or RAM is a/an
37 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
38 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
39 / 50
40 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
41 / 50
The number of nodes in a complete binary tree of height h is
42 / 50
When we call heapify then at each level the comparison performed takes time
43 / 50
44 / 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.
45 / 50
Sorting can be in _________
46 / 50
What type of instructions Random Access Machine (RAM) can execute?
47 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
48 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
49 / 50
50 / 50
What is the total time to heapify?
Your score is
The average score is 40%
Restart quiz
