CS502-Midterm
1 / 50
Is it possible to sort without making comparisons?
2 / 50
The O-notation is used to state only the asymptotic ________bounds.
3 / 50
Which may be a stable sort?
4 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
5 / 50
In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis,
6 / 50
Sorting can be in _________
7 / 50
The Knapsack problem belongs to the domain of _______________ problems.
8 / 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.
9 / 50
Efficient algorithm requires less computational…….
10 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
11 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
12 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
13 / 50
In RAM model instructions are executed
14 / 50
A heap is a left-complete binary tree that conforms to the ___________
15 / 50
______________ graphical representation of algorithm.
16 / 50
In Quick Sort Constants hidden in T(n log n) are
17 / 50
Due to left complete nature of binary tree, the heap can be stored in
18 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
19 / 50
In simple brute-force algorithm, we give no thought to efficiency.
20 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
21 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
22 / 50
For the heap sort we store the tree nodes in
23 / 50
A RAM is an idealized machine with ______________ random-access memory.
24 / 50
The running time of quick sort depends heavily on the selection of
25 / 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.
26 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
27 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
28 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
29 / 50
Sieve Technique can be applied to selection problem?
30 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
31 / 50
Algorithm is concerned with.......issues.
32 / 50
In Sieve Technique we do not know which item is of interest
33 / 50
When we call heapify then at each level the comparison performed takes time
34 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
35 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
36 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
37 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
38 / 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.
39 / 50
How much time merge sort takes for an array of numbers?
40 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
41 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
42 / 50
Analysis of Selection algorithm ends up with,
43 / 50
Random access machine or RAM is a/an
44 / 50
What type of instructions Random Access Machine (RAM) can execute?
45 / 50
The number of nodes in a complete binary tree of height h is
46 / 50
What is the total time to heapify?
47 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
48 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
49 / 50
Quick sort is best from the perspective of Locality of reference.
50 / 50
Your score is
The average score is 40%
Restart quiz
