CS502 Midterm Online Quiz

0%

CS502-Midterm

1 / 50

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

2 / 50

One Example of in place but not stable sort is

3 / 50

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

4 / 50

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

5 / 50

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

from a larger set of _____________

6 / 50

The function f(n)=n(logn+1)/2 is asymptotically equivalent to nlog n. Here Lower Bound means function f(n) grows asymptotically at ____________ as fast as nlog n.

7 / 50

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

8 / 50

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

9 / 50

In Heap Sort algorithm, if heap property is violated _________

10 / 50

A (an) _________ is a left-complete binary tree that conforms to the heap order

11 / 50

______________ graphical representation of algorithm.

12 / 50

Sieve Technique can be applied to selection problem?

13 / 50

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

14 / 50

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

15 / 50

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

16 / 50

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

17 / 50

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

18 / 50

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

19 / 50

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

20 / 50

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

21 / 50

Sorting can be in _________

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

23 / 50

What is the total time to heapify?

24 / 50

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

25 / 50

In which order we can sort?

26 / 50

Quick sort is

27 / 50

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

28 / 50

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

29 / 50

_______________ is a graphical representation of an algorithm

30 / 50

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

31 / 50

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

32 / 50

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

33 / 50

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

34 / 50

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

35 / 50

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

36 / 50

A RAM is an idealized algorithm with takes an infinitely large random-access memory.

37 / 50

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

38 / 50

In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.

39 / 50

While solving Selection problem, in Sieve technique we partition input data __________w

40 / 50

One example of in place but not stable algorithm is

41 / 50

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

42 / 50

What type of instructions Random Access Machine (RAM) can execute? Choose best answer

43 / 50

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

44 / 50

For the heap sort we store the tree nodes in

45 / 50

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

46 / 50

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

47 / 50

Slow sorting algorithms run in,

48 / 50

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

49 / 50

What type of instructions Random Access Machine (RAM) can execute?

50 / 50

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

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