CS502-Midterm
1 / 50
One example of in place but not stable algorithm is
2 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
3 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
4 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
5 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
6 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
7 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
8 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
9 / 50
For the Sieve Technique we take time
10 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
11 / 50
What is the total time to heapify?
12 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
13 / 50
14 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
15 / 50
Which sorting algorithm is faster
16 / 50
In simple brute-force algorithm, we give no thought to efficiency.
17 / 50
Quick sort is best from the perspective of Locality of reference.
18 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
19 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
20 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
21 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
22 / 50
For the heap sort we store the tree nodes in
23 / 50
______________ graphical representation of algorithm.
24 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
25 / 50
Due to left complete nature of binary tree, the heap can be stored in
26 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
27 / 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.
28 / 50
The Knapsack problem belongs to the domain of _______________ problems.
29 / 50
Which may be a stable sort?
30 / 50
Algorithm is concerned with.......issues.
31 / 50
Quick sort is
32 / 50
Analysis of Selection algorithm ends up with,
33 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
34 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
35 / 50
Divide-and-conquer as breaking the problem into a small number of
36 / 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.
37 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
38 / 50
Random access machine or RAM is a/an
39 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
40 / 50
41 / 50
What type of instructions Random Access Machine (RAM) can execute?
42 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
43 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
44 / 50
How much time merge sort takes for an array of numbers?
45 / 50
After sorting in merge sort algorithm, merging process is invoked.
46 / 50
A heap is a left-complete binary tree that conforms to the ___________
47 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
48 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
49 / 50
Is it possible to sort without making comparisons?
50 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
Your score is
The average score is 40%
Restart quiz
