CS502 Midterm Online Quiz

0%

CS502-Midterm

1 / 50

The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.

2 / 50

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

3 / 50

Which may be a stable sort?

4 / 50

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

5 / 50

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

6 / 50

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

7 / 50

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

8 / 50

One example of in place but not stable algorithm is

9 / 50

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

10 / 50

Sieve Technique can be applied to selection problem?

11 / 50

Which sorting algorithm is faster

12 / 50

Counting sort has time complexity:

13 / 50

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

14 / 50

The Knapsack problem belongs to the domain of _______________ problems.

15 / 50

Slow sorting algorithms run in,

16 / 50

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

from a larger set of _____________

17 / 50

The sieve technique works in ___________ as follows

18 / 50

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

19 / 50

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

20 / 50

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

21 / 50

For the Sieve Technique we take time

22 / 50

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

23 / 50

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

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

25 / 50

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

26 / 50

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

27 / 50

What is the total time to heapify?

28 / 50

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

29 / 50

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

30 / 50

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

31 / 50

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

32 / 50

Which may be stable sort:

33 / 50

Floor and ceiling are ____________ to calculate while analyzing algorithms.

34 / 50

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

35 / 50

_______________ is a graphical representation of an algorithm

36 / 50

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

37 / 50

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

38 / 50

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

39 / 50

In which order we can sort?

40 / 50

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

41 / 50

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

42 / 50

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

43 / 50

Quick sort is

44 / 50

Sorting can be in _________

45 / 50

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

46 / 50

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

47 / 50

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

48 / 50

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

49 / 50

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

50 / 50

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

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