CS502 Midterm Online Quiz

0%

CS502-Midterm

1 / 50

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

2 / 50

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

3 / 50

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

4 / 50

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

5 / 50

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

6 / 50

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

7 / 50

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

8 / 50

How much time merge sort takes for an array of numbers?

9 / 50

Which sorting algorithm is faster

10 / 50

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

11 / 50

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

12 / 50

Quick sort is

13 / 50

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

14 / 50

Slow sorting algorithms run in,

15 / 50

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

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

17 / 50

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

18 / 50

The Knapsack problem belongs to the domain of _______________ problems.

19 / 50

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

20 / 50

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

21 / 50

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

22 / 50

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

23 / 50

For the Sieve Technique we take time

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

25 / 50

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

26 / 50

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

27 / 50

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

28 / 50

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

29 / 50

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

30 / 50

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

31 / 50

For the sieve technique we solve the problem,

32 / 50

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

33 / 50

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

34 / 50

Floor and ceiling are ____________ to calculate while analyzing algorithms.

35 / 50

For the heap sort we store the tree nodes in

36 / 50

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

37 / 50

Random access machine or RAM is a/an

38 / 50

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

39 / 50

In Heap Sort algorithm, if heap property is violated _________

40 / 50

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

41 / 50

Counting sort has time complexity:

42 / 50

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

43 / 50

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

44 / 50

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

45 / 50

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

46 / 50

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

47 / 50

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

48 / 50

44.The running time of an algorithm would not depend upon the optimization by the compiler but that of an implementation of the algorithm would depend on it.

49 / 50

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

50 / 50

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

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