CS502-Midterm
1 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
2 / 50
The number of nodes in a complete binary tree of height h is
3 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
4 / 50
_______________ is a graphical representation of an algorithm
5 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
6 / 50
For the heap sort we store the tree nodes in
7 / 50
What type of instructions Random Access Machine (RAM) can execute?
8 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
9 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
10 / 50
For the heap sort, access to nodes involves simple _______________ operations.
11 / 50
Algorithm is concerned with.......issues.
12 / 50
Cont sort is suitable to sort the elements in range 1 to k
13 / 50
In Quick Sort Constants hidden in T(n log n) are
14 / 50
The O-notation is used to state only the asymptotic ________bounds.
15 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
16 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
17 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
18 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
19 / 50
After sorting in merge sort algorithm, merging process is invoked.
20 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
21 / 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.
22 / 50
Slow sorting algorithms run in,
23 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
24 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
25 / 50
Efficient algorithm requires less computational…….
26 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
27 / 50
28 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
29 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
30 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
31 / 50
Upper bound requires that there exist positive constants c2 and n0 such that f(n) ____ c2n for all n <= n0(ye question ghalat lag raha hai mujhae
32 / 50
A heap is a left-complete binary tree that conforms to the ___________
33 / 50
The sieve technique works in ___________ as follows
34 / 50
What is the total time to heapify?
35 / 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.
36 / 50
The running time of quick sort depends heavily on the selection of
37 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
38 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
39 / 50
______________ graphical representation of algorithm.
40 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
41 / 50
42 / 50
In RAM model instructions are executed
43 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
44 / 50
In Sieve Technique we do not know which item is of interest
45 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
46 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
47 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
48 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
49 / 50
In ____________ we have to find rank of an element from given input.
50 / 50
One example of in place but not stable algorithm is
Your score is
The average score is 40%
Restart quiz
