CS502 Midterm Online Quiz

0%

CS502-Midterm

1 / 50

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

2 / 50

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

3 / 50

Which may be stable sort:

4 / 50

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

5 / 50

After sorting in merge sort algorithm, merging process is invoked.

6 / 50

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

7 / 50

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

8 / 50

Sieve Technique can be applied to selection problem?

9 / 50

______________ graphical representation of algorithm.

10 / 50

Which sorting algorithm is faster

11 / 50

Algorithm analysts know for sure about efficient solutions for NP-complete problems.

12 / 50

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

13 / 50

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

14 / 50

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

15 / 50

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

16 / 50

The Knapsack problem belongs to the domain of _______________ problems.

17 / 50

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

18 / 50

Efficient algorithm requires less computational…….

19 / 50

Algorithm is concerned with.......issues.

20 / 50

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

from a larger set of _____________

21 / 50

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

22 / 50

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

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

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

25 / 50

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

26 / 50

Analysis of Selection algorithm ends up with,

27 / 50

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

28 / 50

In which order we can sort?

29 / 50

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

30 / 50

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

31 / 50

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

32 / 50

Sorting can be in _________

33 / 50

In RAM model instructions are executed

34 / 50

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

35 / 50

An in place sorting algorithm is one that uses ___ arrays for storage

36 / 50

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

37 / 50

If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.

38 / 50

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

39 / 50

_______________ is a graphical representation of an algorithm

40 / 50

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

41 / 50

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

42 / 50

In Heap Sort algorithm, if heap property is violated _________

43 / 50

The sieve technique works in ___________ as follows

44 / 50

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

45 / 50

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

46 / 50

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

47 / 50

The sieve technique works where we have to find _________ item(s) from a large input.

48 / 50

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

49 / 50

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

50 / 50

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

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