CS502-Midterm
1 / 50
Which sorting algorithm is faster
2 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
3 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
4 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
5 / 50
A heap is a left-complete binary tree that conforms to the ___________
6 / 50
In which order we can sort?
7 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
8 / 50
What is the total time to heapify?
9 / 50
For the Sieve Technique we take time
10 / 50
A RAM is an idealized machine with ______________ random-access memory.
11 / 50
Slow sorting algorithms run in,
12 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
13 / 50
In Quick Sort Constants hidden in T(n log n) are
14 / 50
15 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
16 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
17 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
18 / 50
Divide-and-conquer as breaking the problem into a small number of
19 / 50
Analysis of Selection algorithm ends up with,
20 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
21 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
22 / 50
Counting sort has time complexity:
23 / 50
After sorting in merge sort algorithm, merging process is invoked.
24 / 50
Efficient algorithm requires less computational…….
25 / 50
In RAM model instructions are executed
26 / 50
The Knapsack problem belongs to the domain of _______________ problems.
27 / 50
For the sieve technique we solve the problem,
28 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
29 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
30 / 50
Random access machine or RAM is a/an
31 / 50
32 / 50
One Example of in place but not stable sort is
33 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
34 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
35 / 50
36 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
37 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
38 / 50
The sieve technique works in ___________ as follows
39 / 50
How much time merge sort takes for an array of numbers?
40 / 50
The sieve technique is a special case, where the number of sub problems is just
41 / 50
In Sieve Technique we do not know which item is of interest
42 / 50
In Heap Sort algorithm, if heap property is violated _________
43 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
44 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
45 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
46 / 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,
47 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
48 / 50
When we call heapify then at each level the comparison performed takes time
49 / 50
In simple brute-force algorithm, we give no thought to efficiency.
50 / 50
Your score is
The average score is 40%
Restart quiz
