CS502 Midterm Online Quiz

0%

CS502-Midterm

1 / 50

Which sorting algorithm is faster

2 / 50

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

3 / 50

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

4 / 50

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

5 / 50

Analysis of Selection algorithm ends up with,

6 / 50

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

7 / 50

The function f(n)= n(logn+1)/2 is asymptotically equivalent to n log n. Here Upper Bound means the function f(n) grows asymptotically ____________ faster than n log n.

8 / 50

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

9 / 50

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

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

11 / 50

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

from a larger set of _____________

12 / 50

The function f(n)=n(logn+1)/2 is asymptotically equivalent to nlog n. Here Lower Bound means function f(n) grows asymptotically at ____________ as fast as nlog n.

13 / 50

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

14 / 50

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

15 / 50

Efficient algorithm requires less computational…….

16 / 50

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

17 / 50

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

18 / 50

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

19 / 50

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

20 / 50

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

21 / 50

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

22 / 50

For the sieve technique we solve the problem,

23 / 50

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

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

In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the

26 / 50

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

27 / 50

In which order we can sort?

28 / 50

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

29 / 50

Counting sort has time complexity:

30 / 50

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

31 / 50

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

32 / 50

What is the total time to heapify?

33 / 50

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

34 / 50

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

35 / 50

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

36 / 50

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

37 / 50

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

38 / 50

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

39 / 50

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

40 / 50

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

41 / 50

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

42 / 50

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

43 / 50

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

44 / 50

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

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

46 / 50

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

47 / 50

The sieve technique works in ___________ as follows

48 / 50

The Knapsack problem belongs to the domain of _______________ problems.

49 / 50

______________ graphical representation of algorithm.

50 / 50

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

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