CS502-Midterm
1 / 50
Random access machine or RAM is a/an
2 / 50
In which order we can sort?
3 / 50
In Heap Sort algorithm, if heap property is violated _________
4 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
5 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
6 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
7 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
8 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
9 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
10 / 50
One Example of in place but not stable sort is
11 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
12 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
13 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
14 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
15 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
16 / 50
In Quick Sort Constants hidden in T(n log n) are
17 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
18 / 50
The Knapsack problem belongs to the domain of _______________ problems.
19 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
20 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
21 / 50
Is it possible to sort without making comparisons?
22 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
23 / 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,
24 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
25 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
26 / 50
Cont sort is suitable to sort the elements in range 1 to k
27 / 50
Counting sort has time complexity:
28 / 50
How much time merge sort takes for an array of numbers?
29 / 50
A heap is a left-complete binary tree that conforms to the ___________
30 / 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.
31 / 50
In Sieve Technique we do not know which item is of interest
32 / 50
The running time of quick sort depends heavily on the selection of
33 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
34 / 50
Efficient algorithm requires less computational…….
35 / 50
36 / 50
In plane sweep approach, a vertical line is swept across the 2d-plane and _______structure is used for holding the maximal points lying to the left of the sweep line.
37 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
38 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
39 / 50
______________ graphical representation of algorithm.
40 / 50
Quick sort is
41 / 50
When we call heapify then at each level the comparison performed takes time
42 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
43 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
44 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
45 / 50
Which may be stable sort:
46 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
47 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
48 / 50
For the Sieve Technique we take time
49 / 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.
50 / 50
In ____________ we have to find rank of an element from given input.
Your score is
The average score is 40%
Restart quiz
