CS502 Midterm Online Quiz

0%

CS502-Midterm

1 / 50

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

2 / 50

Sieve Technique can be applied to selection problem?

3 / 50

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

4 / 50

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

5 / 50

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

6 / 50

An in place sorting algorithm is one that uses ___ arrays for storage

7 / 50

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

8 / 50

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

9 / 50

For the sieve technique we solve the problem,

10 / 50

What is the total time to heapify?

11 / 50

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

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

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

14 / 50

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

15 / 50

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

16 / 50

One Example of in place but not stable sort is

17 / 50

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

18 / 50

In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.

19 / 50

Efficient algorithm requires less computational…….

20 / 50

In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.

21 / 50

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

22 / 50

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

23 / 50

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

24 / 50

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

25 / 50

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

26 / 50

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

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

28 / 50

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

29 / 50

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

30 / 50

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

31 / 50

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

32 / 50

Quick sort is

33 / 50

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

34 / 50

The Knapsack problem belongs to the domain of _______________ problems.

35 / 50

In Heap Sort algorithm, if heap property is violated _________

36 / 50

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

37 / 50

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

38 / 50

One example of in place but not stable algorithm is

39 / 50

In RAM model instructions are executed

40 / 50

______________ graphical representation of algorithm.

41 / 50

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

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

43 / 50

Random access machine or RAM is a/an

44 / 50

In pseudo code, the level of details depends on intended audience of the algorithm.w

45 / 50

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

46 / 50

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

47 / 50

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

48 / 50

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

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

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