CS502-Midterm
1 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
2 / 50
Algorithm is concerned with.......issues.
3 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
4 / 50
For the heap sort we store the tree nodes in
5 / 50
______________ graphical representation of algorithm.
6 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
7 / 50
For the Sieve Technique we take time
8 / 50
Which may be a stable sort?
9 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
10 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
11 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
12 / 50
Quick sort is best from the perspective of Locality of reference.
13 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
14 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
15 / 50
Sieve Technique can be applied to selection problem?
16 / 50
What type of instructions Random Access Machine (RAM) can execute?
17 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
18 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
19 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
20 / 50
In RAM model instructions are executed
21 / 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.
22 / 50
23 / 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.
24 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
25 / 50
A RAM is an idealized machine with ______________ random-access memory.
26 / 50
In Sieve Technique we do not know which item is of interest
27 / 50
After sorting in merge sort algorithm, merging process is invoked.
28 / 50
In which order we can sort?
29 / 50
Which sorting algorithm is faster
30 / 50
Due to left complete nature of binary tree, the heap can be stored in
31 / 50
What is the total time to heapify?
32 / 50
How much time merge sort takes for an array of numbers?
33 / 50
In simple brute-force algorithm, we give no thought to efficiency.
34 / 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,
35 / 50
36 / 50
Analysis of Selection algorithm ends up with,
37 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
38 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
39 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
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
The analysis of Selection algorithm shows the total running time is indeed ________in n,
42 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
43 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
44 / 50
A heap is a left-complete binary tree that conforms to the ___________
45 / 50
In Heap Sort algorithm, if heap property is violated _________
46 / 50
47 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
48 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
49 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
50 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
Your score is
The average score is 40%
Restart quiz
