CS502-Midterm
1 / 50
For the Sieve Technique we take time
2 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
3 / 50
How much time merge sort takes for an array of numbers?
4 / 50
In Quick Sort Constants hidden in T(n log n) are
5 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
6 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
7 / 50
Counting sort has time complexity:
8 / 50
Which sorting algorithm is faster
9 / 50
In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis,
10 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
11 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
12 / 50
Due to left complete nature of binary tree, the heap can be stored in
13 / 50
Which may be stable sort:
14 / 50
In RAM model instructions are executed
15 / 50
After sorting in merge sort algorithm, merging process is invoked.
16 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
17 / 50
In Sieve Technique we do not know which item is of interest
18 / 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.
19 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
20 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
21 / 50
What is the total time to heapify?
22 / 50
For the heap sort we store the tree nodes in
23 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
24 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
25 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
26 / 50
A heap is a left-complete binary tree that conforms to the ___________
27 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
28 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
29 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
30 / 50
Algorithm is concerned with.......issues.
31 / 50
32 / 50
Slow sorting algorithms run in,
33 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
34 / 50
A RAM is an idealized machine with ______________ random-access memory.
35 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
36 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
37 / 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.
38 / 50
The function f(n)=n(logn+1)/2 is asymptotically equivalent to nlog n. Here Lower Bound means function f(n) grows asymptotically at ____________ as fast as nlog n.
39 / 50
Quick sort is best from the perspective of Locality of reference.
40 / 50
Which may be a stable sort?
41 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
42 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
43 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
44 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
45 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
46 / 50
In which order we can sort?
47 / 50
Analysis of Selection algorithm ends up with,
48 / 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.
49 / 50
______________ graphical representation of algorithm.
50 / 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.
Your score is
The average score is 40%
Restart quiz
