CS502 Midterm Online Quiz

0%

CS502-Midterm

1 / 50

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

2 / 50

For the sieve technique we solve the problem,

3 / 50

Analysis of Selection algorithm ends up with,

4 / 50

What is the total time to heapify?

5 / 50

Sorting can be in _________

6 / 50

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

7 / 50

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

8 / 50

For the Sieve Technique we take time

9 / 50

The Knapsack problem belongs to the domain of _______________ problems.

10 / 50

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

11 / 50

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

12 / 50

In Heap Sort algorithm, if heap property is violated _________

13 / 50

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

14 / 50

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

15 / 50

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

16 / 50

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

17 / 50

In which order we can sort?

18 / 50

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

19 / 50

One Example of in place but not stable sort is

20 / 50

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

21 / 50

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

22 / 50

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

23 / 50

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

24 / 50

Upper bound requires that there exist positive constants c2 and n0 such that f(n) ____ c2n for all n <= n0(ye question ghalat lag raha hai mujhae

25 / 50

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

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

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

28 / 50

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

29 / 50

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

30 / 50

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

31 / 50

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

32 / 50

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

33 / 50

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

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

35 / 50

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

36 / 50

Counting sort has time complexity:

37 / 50

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

38 / 50

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

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

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

41 / 50

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

42 / 50

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

43 / 50

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

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

45 / 50

______________ graphical representation of algorithm.

46 / 50

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

47 / 50

What type of instructions Random Access Machine (RAM) can execute? Choose best answer

48 / 50

What type of instructions Random Access Machine (RAM) can execute?

49 / 50

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

50 / 50

The number of nodes in a complete binary tree of height h 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