CS502 Midterm Online Quiz

0%

CS502-Midterm

1 / 50

Counting sort has time complexity:

2 / 50

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

from a larger set of _____________

3 / 50

For the Sieve Technique we take time

4 / 50

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

5 / 50

In Heap Sort algorithm, if heap property is violated _________

6 / 50

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

7 / 50

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

8 / 50

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

9 / 50

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

10 / 50

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

11 / 50

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

12 / 50

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

13 / 50

_______________ is a graphical representation of an algorithm

14 / 50

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

15 / 50

For the sieve technique we solve the problem,

16 / 50

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

17 / 50

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

18 / 50

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

19 / 50

Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,

20 / 50

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

21 / 50

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

22 / 50

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

23 / 50

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

24 / 50

The Knapsack problem belongs to the domain of _______________ problems.

25 / 50

Efficient algorithm requires less computational…….

26 / 50

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

27 / 50

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

28 / 50

Quick sort is

29 / 50

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

30 / 50

In which order we can sort?

31 / 50

For the Sieve Technique we take time

32 / 50

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

33 / 50

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

34 / 50

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

35 / 50

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

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

37 / 50

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

38 / 50

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

39 / 50

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

40 / 50

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

41 / 50

Analysis of Selection algorithm ends up with,

42 / 50

______________ graphical representation of algorithm.

43 / 50

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

44 / 50

The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.

45 / 50

Random access machine or RAM is a/an

46 / 50

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

47 / 50

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

48 / 50

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

49 / 50

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

50 / 50

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

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