CS502 Midterm Online Quiz

0%

CS502-Midterm

1 / 50

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

2 / 50

Quick sort is

3 / 50

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

4 / 50

One example of in place but not stable algorithm is

5 / 50

What is the total time to heapify?

6 / 50

_______________ is a graphical representation of an algorithm

7 / 50

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

8 / 50

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

9 / 50

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

10 / 50

For the sieve technique we solve the problem,

11 / 50

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

12 / 50

Is it possible to sort without making comparisons?

13 / 50

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

14 / 50

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

15 / 50

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

16 / 50

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

17 / 50

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

18 / 50

Random access machine or RAM is a/an

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

20 / 50

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

21 / 50

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

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

23 / 50

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

24 / 50

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

25 / 50

Sieve Technique can be applied to selection problem?

26 / 50

The Knapsack problem belongs to the domain of _______________ problems.

27 / 50

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

28 / 50

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

29 / 50

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

30 / 50

For the Sieve Technique we take time

31 / 50

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

32 / 50

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

33 / 50

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

34 / 50

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

35 / 50

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

36 / 50

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

37 / 50

When we call heapify then at each level the comparison performed takes time

38 / 50

In which order we can sort?

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

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

41 / 50

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

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

43 / 50

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

44 / 50

One Example of in place but not stable sort is

45 / 50

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

46 / 50

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

47 / 50

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

48 / 50

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

49 / 50

Counting sort has time complexity:

50 / 50

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

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