CS502 Midterm Online Quiz

0%

CS502-Midterm

1 / 50

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

2 / 50

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

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

4 / 50

For the sieve technique we solve the problem,

5 / 50

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

6 / 50

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

7 / 50

Quick sort is

8 / 50

Floor and ceiling are ____________ to calculate while analyzing algorithms.

9 / 50

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

10 / 50

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

11 / 50

Analysis of Selection algorithm ends up with,

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

13 / 50

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

14 / 50

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

15 / 50

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

16 / 50

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

17 / 50

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

18 / 50

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

19 / 50

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

20 / 50

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

21 / 50

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

22 / 50

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

23 / 50

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

24 / 50

Which sorting algorithm is faster

25 / 50

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

26 / 50

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

27 / 50

What is the total time to heapify?

28 / 50

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

29 / 50

The sieve technique works in ___________ as follows

30 / 50

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

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

32 / 50

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

33 / 50

In RAM model instructions are executed

34 / 50

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

35 / 50

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

36 / 50

Random access machine or RAM is a/an

37 / 50

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

38 / 50

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

39 / 50

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

40 / 50

Is it possible to sort without making comparisons?

41 / 50

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

42 / 50

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

43 / 50

What is the total time to heapify?

44 / 50

Algorithm is a mathematical entity, which is independent of a specific machine and operating system.

45 / 50

For the heap sort we store the tree nodes in

46 / 50

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

47 / 50

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

48 / 50

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

49 / 50

One Example of in place but not stable sort is

50 / 50

In Heap Sort algorithm, the maximum levels an element can move upward 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