CS502-Midterm
1 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
2 / 50
For the sieve technique we solve the problem,
3 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
4 / 50
Slow sorting algorithms run in,
5 / 50
One example of in place but not stable algorithm is
6 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
7 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
8 / 50
Counting sort has time complexity:
9 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
10 / 50
What type of instructions Random Access Machine (RAM) can execute?
11 / 50
Analysis of Selection algorithm ends up with,
12 / 50
How much time merge sort takes for an array of numbers?
13 / 50
In RAM model instructions are executed
14 / 50
Efficient algorithm requires less computational…….
15 / 50
Due to left complete nature of binary tree, the heap can be stored in
16 / 50
Cont sort is suitable to sort the elements in range 1 to k
17 / 50
Which may be stable sort:
18 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
19 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
20 / 50
Quick sort is
21 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
22 / 50
In Sieve Technique we do not know which item is of interest
23 / 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.
24 / 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.
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 we store the tree nodes in
27 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
28 / 50
______________ graphical representation of algorithm.
29 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
30 / 50
31 / 50
In simple brute-force algorithm, we give no thought to efficiency.
32 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
33 / 50
A heap is a left-complete binary tree that conforms to the ___________
34 / 50
35 / 50
The number of nodes in a complete binary tree of height h is
36 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
37 / 50
Quick sort is best from the perspective of Locality of reference.
38 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
39 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
40 / 50
41 / 50
Sieve Technique can be applied to selection problem?
42 / 50
43 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
44 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
45 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
46 / 50
Which sorting algorithm is faster
47 / 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.
48 / 50
What is the total time to heapify?
49 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
50 / 50
In Quick Sort Constants hidden in T(n log n) are
Your score is
The average score is 40%
Restart quiz
