CS502 Midterm Online Quiz

0%

CS502-Midterm

1 / 50

For the worst-case running time analysis, the nested loop structure containing one “for” and one “while” loop, might be expressed as a pair of _________nested summations.

2 / 50

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

3 / 50

The sieve technique works in ___________ as follows

4 / 50

Analysis of Selection algorithm ends up with,

5 / 50

Which may be stable sort:

6 / 50

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

7 / 50

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

8 / 50

Counting sort has time complexity:

9 / 50

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

10 / 50

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

11 / 50

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

12 / 50

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

13 / 50

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

14 / 50

Floor and ceiling are ____________ to calculate while analyzing algorithms.

15 / 50

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

16 / 50

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

17 / 50

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

18 / 50

Cont sort is suitable to sort the elements in range 1 to k

19 / 50

_______________ is a graphical representation of an algorithm

20 / 50

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

21 / 50

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

22 / 50

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

23 / 50

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

24 / 50

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

25 / 50

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

26 / 50

For the heap sort we store the tree nodes in

27 / 50

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

28 / 50

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

29 / 50

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

30 / 50

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

31 / 50

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

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

33 / 50

The Knapsack problem belongs to the domain of _______________ problems.

34 / 50

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

35 / 50

The array to be sorted is not passed as argument to the merge sort algorithm.

36 / 50

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

37 / 50

Sieve Technique can be applied to selection problem?

38 / 50

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

39 / 50

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

40 / 50

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

41 / 50

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

42 / 50

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

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

44 / 50

Random access machine or RAM is a/an

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

46 / 50

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

47 / 50

What is the total time to heapify?

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

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

50 / 50

The time assumed for each basic operation to execute on RAM model of computation 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