CS502 Midterm Online Quiz

0%

CS502-Midterm

1 / 50

A RAM is an idealized machine with ______________ random-access memory.

2 / 50

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

3 / 50

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

4 / 50

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

5 / 50

Sorting can be in _________

6 / 50

In RAM model instructions are executed

7 / 50

Which sorting algorithm is faster

8 / 50

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

9 / 50

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

10 / 50

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

11 / 50

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

12 / 50

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

13 / 50

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

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

15 / 50

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

16 / 50

The sieve technique works in ___________ as follows

17 / 50

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

18 / 50

Sieve Technique can be applied to selection problem?

19 / 50

Slow sorting algorithms run in,

20 / 50

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

21 / 50

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

22 / 50

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

23 / 50

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

24 / 50

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

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

26 / 50

______________ graphical representation of algorithm.

27 / 50

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

28 / 50

In Heap Sort algorithm, if heap property is violated _________

29 / 50

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

30 / 50

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

31 / 50

The time assumed for each basic operation to execute on RAM model of computation is-----

32 / 50

The number of nodes in a complete binary tree of height h is

33 / 50

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

34 / 50

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

35 / 50

Analysis of Selection algorithm ends up with,

36 / 50

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

37 / 50

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

38 / 50

Floor and ceiling are ____________ to calculate while analyzing algorithms.

39 / 50

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

40 / 50

The function f(n)= n(logn+1)/2 is asymptotically equivalent to n log n. Here Upper Bound means the function f(n) grows asymptotically ____________ faster than n log n.

41 / 50

_______________ is a graphical representation of an algorithm

42 / 50

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

43 / 50

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

44 / 50

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

45 / 50

For the heap sort we store the tree nodes in

46 / 50

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

47 / 50

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

48 / 50

For the Sieve Technique we take time

49 / 50

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

50 / 50

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

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