CS502-Midterm
1 / 50
One Example of in place but not stable sort is
2 / 50
Slow sorting algorithms run in,
3 / 50
For the Sieve Technique we take time
4 / 50
How much time merge sort takes for an array of numbers?
5 / 50
In simple brute-force algorithm, we give no thought to efficiency.
6 / 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.
7 / 50
What type of instructions Random Access Machine (RAM) can execute?
8 / 50
Analysis of Selection algorithm ends up with,
9 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
10 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
11 / 50
Is it possible to sort without making comparisons?
12 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
13 / 50
Divide-and-conquer as breaking the problem into a small number of
14 / 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.
15 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
16 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
17 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
18 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
19 / 50
After sorting in merge sort algorithm, merging process is invoked.
20 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
21 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
22 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
23 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
24 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
25 / 50
A heap is a left-complete binary tree that conforms to the ___________
26 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
27 / 50
When we call heapify then at each level the comparison performed takes time
28 / 50
What is the total time to heapify?
29 / 50
In Heap Sort algorithm, if heap property is violated _________
30 / 50
31 / 50
______________ graphical representation of algorithm.
32 / 50
The Knapsack problem belongs to the domain of _______________ problems.
33 / 50
Quick sort is
34 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
35 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
36 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
37 / 50
In Quick Sort Constants hidden in T(n log n) are
38 / 50
Upper bound requires that there exist positive constants c2 and n0 such that f(n) ____ c2n for all n <= n0(ye question ghalat lag raha hai mujhae
39 / 50
Efficient algorithm requires less computational…….
40 / 50
For the heap sort we store the tree nodes in
41 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
42 / 50
43 / 50
Sieve Technique can be applied to selection problem?
44 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
45 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
46 / 50
Which may be stable sort:
47 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
48 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
49 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
50 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
Your score is
The average score is 40%
Restart quiz
