CS502-Midterm
1 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
2 / 50
Is it possible to sort without making comparisons?
3 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
4 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
5 / 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.
6 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
7 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
8 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
9 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
10 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
11 / 50
In RAM model instructions are executed
12 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
13 / 50
Counting sort has time complexity:
14 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
15 / 50
A RAM is an idealized machine with ______________ random-access memory.
16 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
17 / 50
Due to left complete nature of binary tree, the heap can be stored in
18 / 50
Cont sort is suitable to sort the elements in range 1 to k
19 / 50
After sorting in merge sort algorithm, merging process is invoked.
20 / 50
Sorting can be in _________
21 / 50
Analysis of Selection algorithm ends up with,
22 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
23 / 50
How much time merge sort takes for an array of numbers?
24 / 50
In Sieve Technique we do not know which item is of interest
25 / 50
Divide-and-conquer as breaking the problem into a small number of
26 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
27 / 50
One Example of in place but not stable sort is
28 / 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.
29 / 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.
30 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
31 / 50
32 / 50
The sieve technique is a special case, where the number of sub problems is just
33 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
34 / 50
What is the total time to heapify?
35 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
36 / 50
37 / 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,
38 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
39 / 50
For the heap sort we store the tree nodes in
40 / 50
Which sorting algorithm is faster
41 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
42 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
43 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
44 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
45 / 50
Sieve Technique can be applied to selection problem?
46 / 50
Random access machine or RAM is a/an
47 / 50
When we call heapify then at each level the comparison performed takes time
48 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
49 / 50
For the Sieve Technique we take time
50 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
Your score is
The average score is 40%
Restart quiz
