CS502 Midterm Online Quiz

0%

CS502-Midterm

1 / 50

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

2 / 50

The running time of quick sort depends heavily on the selection of

3 / 50

Slow sorting algorithms run in,

4 / 50

In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.

5 / 50

Quick sort is

6 / 50

One example of in place but not stable algorithm is

7 / 50

Efficient algorithm requires less computational…….

8 / 50

Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________

9 / 50

For the heap sort we store the tree nodes in

10 / 50

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

11 / 50

The definition of Theta-notation relies on proving ___________asymptotic bound.

12 / 50

Algorithm is a mathematical entity, which is independent of a specific machine and operating system.

13 / 50

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

14 / 50

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

15 / 50

An algorithm is a mathematical entity that is dependent on a specific programming language.

16 / 50

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

17 / 50

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

18 / 50

Which sorting algorithm is faster

19 / 50

Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,

20 / 50

For the sieve technique we solve the problem,

21 / 50

Which may be stable sort:

22 / 50

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

23 / 50

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

24 / 50

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

25 / 50

In RAM model instructions are executed

26 / 50

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

27 / 50

What is the total time to heapify?

28 / 50

______________ graphical representation of algorithm.

29 / 50

In ____________ we have to find rank of an element from given input.

30 / 50

Brute-force algorithm uses no intelligence in pruning out decisions.

31 / 50

Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.

32 / 50

Counting sort has time complexity:

33 / 50

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

34 / 50

For the Sieve Technique we take time

35 / 50

In which order we can sort?

36 / 50

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

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

38 / 50

Sieve Technique can be applied to selection problem?

39 / 50

In 2d-space a point is said to be ________if it is not dominated by any other point in that space.

40 / 50

One Example of in place but not stable sort is

41 / 50

In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the

42 / 50

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

43 / 50

Quick sort is best from the perspective of Locality of reference.

44 / 50

Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.

45 / 50

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

46 / 50

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

47 / 50

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

48 / 50

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

49 / 50

In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,

50 / 50

Sieve Technique applies to problems where we are interested in finding a single item

from a larger set of _____________

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