CS502 Midterm Online Quiz

0%

CS502-Midterm

1 / 50

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

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

3 / 50

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

4 / 50

Which sorting algorithm is faster

5 / 50

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

6 / 50

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

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

8 / 50

Sieve Technique can be applied to selection problem?

9 / 50

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

10 / 50

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

11 / 50

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

12 / 50

Analysis of Selection algorithm ends up with,

13 / 50

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

14 / 50

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

15 / 50

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

16 / 50

In RAM model instructions are executed

17 / 50

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

18 / 50

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

19 / 50

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

20 / 50

F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.

21 / 50

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

22 / 50

For the heap sort we store the tree nodes in

23 / 50

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

24 / 50

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

25 / 50

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

26 / 50

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

27 / 50

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

28 / 50

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

29 / 50

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

30 / 50

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

31 / 50

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

32 / 50

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

33 / 50

For the Sieve Technique we take time

34 / 50

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

35 / 50

In which order we can sort?

36 / 50

The Knapsack problem belongs to the domain of _______________ problems.

37 / 50

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

38 / 50

For the sieve technique we solve the problem,

39 / 50

Quick sort is

40 / 50

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

41 / 50

Is it possible to sort without making comparisons?

42 / 50

Floor and ceiling are ____________ to calculate while analyzing algorithms.

43 / 50

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

44 / 50

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

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

46 / 50

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

47 / 50

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

48 / 50

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

49 / 50

Efficient algorithm requires less computational…….

50 / 50

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

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