CS502-Midterm
1 / 50
_______________ is a graphical representation of an algorithm
2 / 50
In Sieve Technique we do not know which item is of interest
3 / 50
If we associate (x, y) integers pair to cars where x is the speed of the car and y is the negation of the price. High y value for a car means a ________ car.
4 / 50
One example of in place but not stable algorithm is
5 / 50
The Knapsack problem belongs to the domain of _______________ problems.
6 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
7 / 50
In simple brute-force algorithm, we give no thought to efficiency.
8 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
9 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
10 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
11 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
12 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
13 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
14 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
15 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
16 / 50
Analysis of Selection algorithm ends up with,
17 / 50
In Quick Sort Constants hidden in T(n log n) are
18 / 50
In Heap Sort algorithm, if heap property is violated _________
19 / 50
Random access machine or RAM is a/an
20 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
21 / 50
The O-notation is used to state only the asymptotic ________bounds.
22 / 50
What type of instructions Random Access Machine (RAM) can execute?
23 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
24 / 50
Efficient algorithm requires less computational…….
25 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
26 / 50
27 / 50
What is the total time to heapify?
28 / 50
44.The running time of an algorithm would not depend upon the optimization by the compiler but that of an implementation of the algorithm would depend on it.
29 / 50
For the Sieve Technique we take time
30 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
31 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
32 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
33 / 50
34 / 50
35 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
36 / 50
A heap is a left-complete binary tree that conforms to the ___________
37 / 50
In RAM model instructions are executed
38 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
39 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
40 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
41 / 50
The sieve technique works in ___________ as follows
42 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
43 / 50
Quick sort is
44 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
45 / 50
46 / 50
The function f(n)=n(logn+1)/2 is asymptotically equivalent to nlog n. Here Lower Bound means function f(n) grows asymptotically at ____________ as fast as nlog n.
47 / 50
48 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
49 / 50
One Example of in place but not stable sort is
50 / 50
Is it possible to sort without making comparisons?
Your score is
The average score is 40%
Restart quiz
