CS502-Midterm
1 / 50
One Example of in place but not stable sort is
2 / 50
In Heap Sort algorithm, if heap property is violated _________
3 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
4 / 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.
5 / 50
For the heap sort, access to nodes involves simple _______________ operations.
6 / 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.
7 / 50
Which sorting algorithm is faster
8 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
9 / 50
What is the total time to heapify?
10 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
11 / 50
Random access machine or RAM is a/an
12 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
13 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
14 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
15 / 50
What type of instructions Random Access Machine (RAM) can execute?
16 / 50
In Sieve Technique we do not know which item is of interest
17 / 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.
18 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
19 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
20 / 50
In Quick Sort Constants hidden in T(n log n) are
21 / 50
In simple brute-force algorithm, we give no thought to efficiency.
22 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
23 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
24 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
25 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
26 / 50
When we call heapify then at each level the comparison performed takes time
27 / 50
28 / 50
In RAM model instructions are executed
29 / 50
Is it possible to sort without making comparisons?
30 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
31 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
32 / 50
For the Sieve Technique we take time
33 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
34 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
35 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
36 / 50
The Knapsack problem belongs to the domain of _______________ problems.
37 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
38 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
39 / 50
The sieve technique is a special case, where the number of sub problems is just
40 / 50
For the sieve technique we solve the problem,
41 / 50
Which may be a stable sort?
42 / 50
Which may be stable sort:
43 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
44 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
45 / 50
A RAM is an idealized machine with ______________ random-access memory.
46 / 50
Efficient algorithm requires less computational…….
47 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
48 / 50
Due to left complete nature of binary tree, the heap can be stored in
49 / 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.
50 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
Your score is
The average score is 40%
Restart quiz
