CS502 Midterm Online Quiz

0%

CS502-Midterm

1 / 50

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

2 / 50

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

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

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

5 / 50

Floor and ceiling are ____________ to calculate while analyzing algorithms.

6 / 50

In which order we can sort?

7 / 50

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

8 / 50

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

9 / 50

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

10 / 50

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

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

12 / 50

If we associate (x, y) integers pair to cars where x is the speed of the car and y is the negation of the price. High y value for a car means a ________ car.

13 / 50

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

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

15 / 50

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

16 / 50

_______________ is a graphical representation of an algorithm

17 / 50

Random access machine or RAM is a/an

18 / 50

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

19 / 50

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

20 / 50

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

21 / 50

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

22 / 50

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

23 / 50

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

24 / 50

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

25 / 50

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

26 / 50

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

27 / 50

The sieve technique works in ___________ as follows

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

29 / 50

Efficient algorithm requires less computational…….

30 / 50

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

31 / 50

The Knapsack problem belongs to the domain of _______________ problems.

32 / 50

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

33 / 50

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

34 / 50

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

35 / 50

Slow sorting algorithms run in,

36 / 50

For the sieve technique we solve the problem,

37 / 50

Which sorting algorithm is faster

38 / 50

For the heap sort we store the tree nodes in

39 / 50

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

40 / 50

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

41 / 50

Asymptotic growth rate of the function is taken over_________ case running time.

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

43 / 50

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

44 / 50

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

45 / 50

For the Sieve Technique we take time

46 / 50

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

47 / 50

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

48 / 50

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

49 / 50

Which may be stable sort:

50 / 50

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

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