CS502-Midterm
1 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
2 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
3 / 50
Divide-and-conquer as breaking the problem into a small number of
4 / 50
The Knapsack problem belongs to the domain of _______________ problems.
5 / 50
A RAM is an idealized machine with ______________ random-access memory.
6 / 50
The O-notation is used to state only the asymptotic ________bounds.
7 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
8 / 50
_______________ is a graphical representation of an algorithm
9 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
10 / 50
For the sieve technique we solve the problem,
11 / 50
Sorting can be in _________
12 / 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
13 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
14 / 50
In Heap Sort algorithm, if heap property is violated _________
15 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
16 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
17 / 50
What is the total time to heapify?
18 / 50
Efficient algorithm requires less computational…….
19 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
20 / 50
The number of nodes in a complete binary tree of height h is
21 / 50
In Sieve Technique we do not know which item is of interest
22 / 50
Sieve Technique can be applied to selection problem?
23 / 50
The sieve technique works in ___________ as follows
24 / 50
In Quick Sort Constants hidden in T(n log n) are
25 / 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.
26 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
27 / 50
The running time of quick sort depends heavily on the selection of
28 / 50
Is it possible to sort without making comparisons?
29 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
30 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
31 / 50
A heap is a left-complete binary tree that conforms to the ___________
32 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
33 / 50
One example of in place but not stable algorithm is
34 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
35 / 50
36 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
37 / 50
Slow sorting algorithms run in,
38 / 50
In RAM model instructions are executed
39 / 50
40 / 50
For the Sieve Technique we take time
41 / 50
Analysis of Selection algorithm ends up with,
42 / 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.
43 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
44 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
45 / 50
46 / 50
What type of instructions Random Access Machine (RAM) can execute?
47 / 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.
48 / 50
Which may be stable sort:
49 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
50 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
Your score is
The average score is 40%
Restart quiz
