CS502-Midterm
1 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
2 / 50
For the Sieve Technique we take time
3 / 50
The O-notation is used to state only the asymptotic ________bounds.
4 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
5 / 50
The running time of quick sort depends heavily on the selection of
6 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
7 / 50
The Knapsack problem belongs to the domain of _______________ problems.
8 / 50
Random access machine or RAM is a/an
9 / 50
In Heap Sort algorithm, if heap property is violated _________
10 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
11 / 50
In ____________ we have to find rank of an element from given input.
12 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
13 / 50
Analysis of Selection algorithm ends up with,
14 / 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
15 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
16 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
17 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
18 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
19 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
20 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
21 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
22 / 50
Which may be stable sort:
23 / 50
Sieve Technique can be applied to selection problem?
24 / 50
What is the total time to heapify?
25 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
26 / 50
Divide-and-conquer as breaking the problem into a small number of
27 / 50
In which order we can sort?
28 / 50
Which sorting algorithm is faster
29 / 50
In RAM model instructions are executed
30 / 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.
31 / 50
32 / 50
Efficient algorithm requires less computational…….
33 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
34 / 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.
35 / 50
_______________ is a graphical representation of an algorithm
36 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
37 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
38 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
39 / 50
When we call heapify then at each level the comparison performed takes time
40 / 50
Cont sort is suitable to sort the elements in range 1 to k
41 / 50
For the heap sort, access to nodes involves simple _______________ operations.
42 / 50
Counting sort has time complexity:
43 / 50
After sorting in merge sort algorithm, merging process is invoked.
44 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
45 / 50
In Sieve Technique we do not know which item is of interest
46 / 50
Slow sorting algorithms run in,
47 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
48 / 50
A heap is a left-complete binary tree that conforms to the ___________
49 / 50
50 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
Your score is
The average score is 40%
Restart quiz
