CS502-Midterm
1 / 50
How much time merge sort takes for an array of numbers?
2 / 50
The running time of quick sort depends heavily on the selection of
3 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
4 / 50
44.The running time of an algorithm would not depend upon the optimization by the compiler but that of an implementation of the algorithm would depend on it.
5 / 50
For the Sieve Technique we take time
6 / 50
Sieve Technique can be applied to selection problem?
7 / 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.
8 / 50
In RAM model instructions are executed
9 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
10 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
11 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
12 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
13 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
14 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
15 / 50
Quick sort is
16 / 50
Is it possible to sort without making comparisons?
17 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
18 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
19 / 50
Analysis of Selection algorithm ends up with,
20 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
21 / 50
What is the total time to heapify?
22 / 50
In Sieve Technique we do not know which item is of interest
23 / 50
Random access machine or RAM is a/an
24 / 50
The Knapsack problem belongs to the domain of _______________ problems.
25 / 50
26 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
27 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
28 / 50
In which order we can sort?
29 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
30 / 50
For the heap sort we store the tree nodes in
31 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
32 / 50
Due to left complete nature of binary tree, the heap can be stored in
33 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
34 / 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.
35 / 50
_______________ is a graphical representation of an algorithm
36 / 50
Counting sort has time complexity:
37 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
38 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
39 / 50
Which may be stable sort:
40 / 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
41 / 50
In simple brute-force algorithm, we give no thought to efficiency.
42 / 50
One example of in place but not stable algorithm is
43 / 50
44 / 50
Sorting can be in _________
45 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
46 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
47 / 50
One Example of in place but not stable sort is
48 / 50
Slow sorting algorithms run in,
49 / 50
50 / 50
Efficient algorithm requires less computational…….
Your score is
The average score is 40%
Restart quiz
