CS502-Midterm
1 / 50
Consider the following code:
For(j=1; j
For(k=1; k<15;k++)
For(l=5; l
{
Do_something_constant();
}
What is the order of execution for this code.
2 / 50
What is the total time to heapify?
3 / 50
Slow sorting algorithms run in,
4 / 50
How much time merge sort takes for an array of numbers?
5 / 50
Due to left complete nature of binary tree, the heap can be stored in
6 / 50
In Sieve Technique we do not know which item is of interest
7 / 50
One example of in place but not stable algorithm is
8 / 50
Which sorting algorithm is faster
9 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
10 / 50
_______________ is a graphical representation of an algorithm
11 / 50
For the sieve technique we solve the problem,
12 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
13 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
14 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
15 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
16 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
17 / 50
In Heap Sort algorithm, if heap property is violated _________
18 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
19 / 50
What type of instructions Random Access Machine (RAM) can execute?
20 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
21 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
22 / 50
The number of nodes in a complete binary tree of height h is
23 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
24 / 50
Sieve Technique can be applied to selection problem?
25 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
26 / 50
27 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
28 / 50
After sorting in merge sort algorithm, merging process is invoked.
29 / 50
The sieve technique works in ___________ as follows
30 / 50
In simple brute-force algorithm, we give no thought to efficiency.
31 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
32 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
33 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
34 / 50
Which may be a stable sort?
35 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
36 / 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
37 / 50
Divide-and-conquer as breaking the problem into a small number of
38 / 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.
39 / 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.
40 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
41 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
42 / 50
Is it possible to sort without making comparisons?
43 / 50
Analysis of Selection algorithm ends up with,
44 / 50
For the Sieve Technique we take time
45 / 50
Random access machine or RAM is a/an
46 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
47 / 50
Algorithm is concerned with.......issues.
48 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
49 / 50
50 / 50
Your score is
The average score is 40%
Restart quiz
