CS502 Midterm Online Quiz

0%

CS502-Midterm

1 / 50

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

2 / 50

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

3 / 50

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

4 / 50

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

5 / 50

The sieve technique works in ___________ as follows

6 / 50

For the heap sort we store the tree nodes in

7 / 50

Which may be a stable sort?

8 / 50

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

9 / 50

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

10 / 50

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

11 / 50

Analysis of Selection algorithm ends up with,

12 / 50

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

13 / 50

One Example of in place but not stable sort is

14 / 50

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

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

16 / 50

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

from a larger set of _____________

17 / 50

One example of in place but not stable algorithm is

18 / 50

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

19 / 50

The analysis of Selection algorithm shows the total running time is indeed ________in n,

20 / 50

What is the solution to the recurrence T(n) = T(n/2)+n .

21 / 50

While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.

22 / 50

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

23 / 50

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

24 / 50

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

25 / 50

_______________ is a graphical representation of an algorithm

26 / 50

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

27 / 50

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

28 / 50

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

29 / 50

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

30 / 50

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

31 / 50

The Knapsack problem belongs to the domain of _______________ problems.

32 / 50

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

33 / 50

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

34 / 50

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

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

36 / 50

Slow sorting algorithms run in,

37 / 50

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

38 / 50

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

39 / 50

If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.

40 / 50

In which order we can sort?

41 / 50

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

42 / 50

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

43 / 50

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

44 / 50

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

45 / 50

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

46 / 50

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

47 / 50

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

48 / 50

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

49 / 50

For the Sieve Technique we take time

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