CS502-Midterm
1 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
2 / 50
In Sieve Technique we do not know which item is of interest
3 / 50
Cont sort is suitable to sort the elements in range 1 to k
4 / 50
In ____________ we have to find rank of an element from given input.
5 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
6 / 50
When we call heapify then at each level the comparison performed takes time
7 / 50
A heap is a left-complete binary tree that conforms to the ___________
8 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
9 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
10 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
11 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
12 / 50
Random access machine or RAM is a/an
13 / 50
In which order we can sort?
14 / 50
Due to left complete nature of binary tree, the heap can be stored in
15 / 50
16 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
17 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
18 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
19 / 50
The running time of quick sort depends heavily on the selection of
20 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
21 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
22 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
23 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
24 / 50
Sorting can be in _________
25 / 50
The sieve technique works in ___________ as follows
26 / 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.
27 / 50
What type of instructions Random Access Machine (RAM) can execute?
28 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
29 / 50
In simple brute-force algorithm, we give no thought to efficiency.
30 / 50
After sorting in merge sort algorithm, merging process is invoked.
31 / 50
The Knapsack problem belongs to the domain of _______________ problems.
32 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
33 / 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
34 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
35 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
36 / 50
The number of nodes in a complete binary tree of height h is
37 / 50
38 / 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.
39 / 50
In RAM model instructions are executed
40 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
41 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
42 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
43 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
44 / 50
Is it possible to sort without making comparisons?
45 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
46 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
47 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
48 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
49 / 50
In Quick Sort Constants hidden in T(n log n) are
50 / 50
For the heap sort we store the tree nodes in
Your score is
The average score is 40%
Restart quiz
