CS502 Midterm Online Quiz

0%

CS502-Midterm

1 / 50

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

2 / 50

We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.

3 / 50

Quick sort is

4 / 50

One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.

5 / 50

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

6 / 50

For the heap sort we store the tree nodes in

7 / 50

For the sieve technique we solve the problem,

8 / 50

In RAM model instructions are executed

9 / 50

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

from a larger set of _____________

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

11 / 50

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

12 / 50

Random access machine or RAM is a/an

13 / 50

Floor and ceiling are ____________ to calculate while analyzing algorithms.

14 / 50

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

15 / 50

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

16 / 50

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

17 / 50

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

18 / 50

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

19 / 50

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

20 / 50

Efficient algorithm requires less computational…….

21 / 50

Divide-and-conquer as breaking the problem into a small number of

22 / 50

One example of in place but not stable algorithm is

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

24 / 50

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

25 / 50

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

26 / 50

The sieve technique works in ___________ as follows

27 / 50

In which order we can sort?

28 / 50

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

29 / 50

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

30 / 50

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

31 / 50

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

32 / 50

Sieve Technique can be applied to selection problem?

33 / 50

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

34 / 50

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

35 / 50

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

36 / 50

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

37 / 50

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

38 / 50

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

39 / 50

One Example of in place but not stable sort is

40 / 50

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

41 / 50

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

42 / 50

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

43 / 50

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

44 / 50

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

45 / 50

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

46 / 50

Which may be stable sort:

47 / 50

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

48 / 50

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

49 / 50

_______________ is a graphical representation of an algorithm

50 / 50

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

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