CS502-Midterm
1 / 50
In RAM model instructions are executed
2 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
3 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
4 / 50
One example of in place but not stable algorithm is
5 / 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.
6 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
7 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
8 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
9 / 50
Divide-and-conquer as breaking the problem into a small number of
10 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
11 / 50
Is it possible to sort without making comparisons?
12 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
13 / 50
Which may be a stable sort?
14 / 50
Efficient algorithm requires less computational…….
15 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
16 / 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.
17 / 50
A heap is a left-complete binary tree that conforms to the ___________
18 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
19 / 50
______________ graphical representation of algorithm.
20 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
21 / 50
What is the total time to heapify?
22 / 50
Quick sort is
23 / 50
After sorting in merge sort algorithm, merging process is invoked.
24 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
25 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
26 / 50
In Quick Sort Constants hidden in T(n log n) are
27 / 50
One Example of in place but not stable sort is
28 / 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,
29 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
30 / 50
In ____________ we have to find rank of an element from given input.
31 / 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.
32 / 50
Analysis of Selection algorithm ends up with,
33 / 50
34 / 50
Sieve Technique can be applied to selection problem?
35 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
36 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
37 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
38 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
39 / 50
Random access machine or RAM is a/an
40 / 50
In Sieve Technique we do not know which item is of interest
41 / 50
The sieve technique works in ___________ as follows
42 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
43 / 50
Slow sorting algorithms run in,
44 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
45 / 50
How much time merge sort takes for an array of numbers?
46 / 50
_______________ is a graphical representation of an algorithm
47 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
48 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
49 / 50
Which sorting algorithm is faster
50 / 50
Your score is
The average score is 40%
Restart quiz
