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

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

3 / 50

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

4 / 50

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

5 / 50

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

6 / 50

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

7 / 50

One Example of in place but not stable sort is

8 / 50

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

from a larger set of _____________

9 / 50

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

10 / 50

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

11 / 50

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

12 / 50

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

13 / 50

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

14 / 50

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

15 / 50

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

16 / 50

What is the total time to heapify?

17 / 50

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

18 / 50

______________ graphical representation of algorithm.

19 / 50

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

20 / 50

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

21 / 50

In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.

22 / 50

The sieve technique works in ___________ as follows

23 / 50

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

24 / 50

Counting sort has time complexity:

25 / 50

Sieve Technique can be applied to selection problem?

26 / 50

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

27 / 50

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

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

29 / 50

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

30 / 50

Which may be a stable sort?

31 / 50

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

32 / 50

Analysis of Selection algorithm ends up with,

33 / 50

In Heap Sort algorithm, if heap property is violated _________

34 / 50

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

35 / 50

_______________ is a graphical representation of an algorithm

36 / 50

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

37 / 50

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

38 / 50

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

39 / 50

Quick sort is

40 / 50

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

41 / 50

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

42 / 50

Which sorting algorithm is faster

43 / 50

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

44 / 50

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

45 / 50

Sorting can be in _________

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

47 / 50

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

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

49 / 50

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

50 / 50

What is the total time to heapify?

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