CS502 Midterm Online Quiz

0%

CS502-Midterm

1 / 50

The O-notation is used to state only the asymptotic ________bounds.

2 / 50

In pseudo code, the level of details depends on intended audience of the algorithm.w

3 / 50

For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.

4 / 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.

5 / 50

When we call heapify then at each level the comparison performed takes time

6 / 50

Quick sort is

7 / 50

In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.

8 / 50

Asymptotic growth rate of the function is taken over_________ case running time.

9 / 50

The analysis of Selection algorithm shows the total running time is indeed ________in n,

10 / 50

In Quick Sort Constants hidden in T(n log n) are

11 / 50

A point p in 2-dimensional space is usually given by its integer coordinate(s)____________

12 / 50

Random access machine or RAM is a/an

13 / 50

Sorting can be in _________

14 / 50

For the heap sort, access to nodes involves simple _______________ operations.

15 / 50

Analysis of Selection algorithm ends up with,

16 / 50

The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,

17 / 50

In Sieve Technique we do not know which item is of interest

18 / 50

In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.

19 / 50

For Chain Matrix Multiplication we can not use divide and conquer approach because,

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

For the Sieve Technique we take time

22 / 50

While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.

23 / 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.

24 / 50

In simple brute-force algorithm, we give no thought to efficiency.

25 / 50

What is the total time to heapify?

26 / 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

27 / 50

A heap is a left-complete binary tree that conforms to the ___________

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

_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.

30 / 50

If there are Θ (n2) entries in edit distance matrix then the total running time is

31 / 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.

32 / 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.

33 / 50

The array to be sorted is not passed as argument to the merge sort algorithm.

34 / 50

In Quick Sort Constants hidden in T(n log n) are

35 / 50

Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:

36 / 50

Which may be a stable sort?

37 / 50

Slow sorting algorithms run in,

38 / 50

Due to left complete nature of binary tree, the heap can be stored in

39 / 50

What is the solution to the recurrence T(n) = T(n/2)+n .

40 / 50

The sieve technique is a special case, where the number of sub problems is just

41 / 50

In Heap Sort algorithm, the maximum levels an element can move upward is _________

42 / 50

In Heap Sort algorithm, we build _______ for ascending sort.

43 / 50

How many elements do we eliminate in each time for the Analysis of Selection algorithm?

44 / 50

In Quick sort, we don’t have the control over the sizes of recursive calls

45 / 50

F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.

46 / 50

For the heap sort we store the tree nodes in

47 / 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,

48 / 50

For the Sieve Technique we take time

49 / 50

In Heap Sort algorithm, the total running time for Heapify procedure is ____________

50 / 50

In Heap Sort algorithm, if heap property is violated _________

Your score is

The average score is 40%

0%

Qunoot e Nazilah
Dua e Hajat
4 Qul
6 Kalma
Dua-e-Akasha
Darood Akbar
Surah Fatiha
Dua-e-Ganj Ul Arsh
Dua-e-Jamilah
Ayat-ul-Kursi