CS502 Midterm Online Quiz

0%

CS502-Midterm

1 / 50

What is the total time to heapify?

2 / 50

Which may be a stable sort?

3 / 50

Counting sort has time complexity:

4 / 50

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

5 / 50

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

6 / 50

In Heap Sort algorithm, if heap property is violated _________

7 / 50

Random access machine or RAM is a/an

8 / 50

Analysis of Selection algorithm ends up with,

9 / 50

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

10 / 50

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

11 / 50

Slow sorting algorithms run in,

12 / 50

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

13 / 50

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

14 / 50

The Knapsack problem belongs to the domain of _______________ problems.

15 / 50

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

16 / 50

For the Sieve Technique we take time

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

18 / 50

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

19 / 50

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

20 / 50

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

21 / 50

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

22 / 50

______________ graphical representation of algorithm.

23 / 50

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

24 / 50

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

25 / 50

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

26 / 50

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

27 / 50

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

28 / 50

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

29 / 50

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

30 / 50

Sorting can be in _________

31 / 50

Is it possible to sort without making comparisons?

32 / 50

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

33 / 50

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

34 / 50

Consider the following code:

For(j=1; j

For(k=1; k<15;k++)

For(l=5; l

{

Do_something_constant();

}

What is the order of execution for this code.

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

36 / 50

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

37 / 50

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

38 / 50

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

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

40 / 50

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

41 / 50

Cont sort is suitable to sort the elements in range 1 to k

42 / 50

Which sorting algorithm is faster

43 / 50

For the heap sort we store the tree nodes in

44 / 50

Asymptotic growth rate of the function is taken over_________ case running time.

45 / 50

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

46 / 50

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

47 / 50

In RAM model instructions are executed

48 / 50

Which may be stable sort:

49 / 50

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

50 / 50

Sieve Technique can be applied to selection problem?

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