CS502-Midterm
1 / 50
One example of in place but not stable algorithm is
2 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
3 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
4 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
5 / 50
In which order we can sort?
6 / 50
For the Sieve Technique we take time
7 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
8 / 50
One Example of in place but not stable sort is
9 / 50
10 / 50
Counting sort has time complexity:
11 / 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.
12 / 50
Sieve Technique can be applied to selection problem?
13 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
14 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
15 / 50
Which sorting algorithm is faster
16 / 50
Algorithm is concerned with.......issues.
17 / 50
Sorting can be in _________
18 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
19 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
20 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
21 / 50
In ____________ we have to find rank of an element from given input.
22 / 50
For the heap sort, access to nodes involves simple _______________ operations.
23 / 50
A heap is a left-complete binary tree that conforms to the ___________
24 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
25 / 50
What is the total time to heapify?
26 / 50
The O-notation is used to state only the asymptotic ________bounds.
27 / 50
_______________ is a graphical representation of an algorithm
28 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
29 / 50
Random access machine or RAM is a/an
30 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
31 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
32 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
33 / 50
In Quick Sort Constants hidden in T(n log n) are
34 / 50
The Knapsack problem belongs to the domain of _______________ problems.
35 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
36 / 50
What type of instructions Random Access Machine (RAM) can execute?
37 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
38 / 50
After sorting in merge sort algorithm, merging process is invoked.
39 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
40 / 50
Analysis of Selection algorithm ends up with,
41 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
42 / 50
Due to left complete nature of binary tree, the heap can be stored in
43 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
44 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
45 / 50
Quick sort is
46 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
47 / 50
The number of nodes in a complete binary tree of height h is
48 / 50
49 / 50
50 / 50
In simple brute-force algorithm, we give no thought to efficiency.
Your score is
The average score is 40%
Restart quiz
