CS502 Midterm Online Quiz

0%

CS502-Midterm

1 / 50

Sorting can be in _________

2 / 50

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

3 / 50

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

4 / 50

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

5 / 50

For the Sieve Technique we take time

6 / 50

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

7 / 50

Floor and ceiling are ____________ to calculate while analyzing algorithms.

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

9 / 50

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

10 / 50

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

11 / 50

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

12 / 50

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

13 / 50

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

14 / 50

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

15 / 50

For the Sieve Technique we take time

16 / 50

_______________ is a graphical representation of an algorithm

17 / 50

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

18 / 50

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

19 / 50

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

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

21 / 50

Efficient algorithm requires less computational…….

22 / 50

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

23 / 50

______________ graphical representation of algorithm.

24 / 50

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

25 / 50

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

26 / 50

What is the total time to heapify?

27 / 50

Is it possible to sort without making comparisons?

28 / 50

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

29 / 50

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

30 / 50

For the sieve technique we solve the problem,

31 / 50

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

32 / 50

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

33 / 50

Counting sort has time complexity:

34 / 50

In Heap Sort algorithm, if heap property is violated _________

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

36 / 50

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

37 / 50

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

38 / 50

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

39 / 50

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

40 / 50

Which sorting algorithm is faster

41 / 50

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

42 / 50

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

43 / 50

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

44 / 50

The Knapsack problem belongs to the domain of _______________ problems.

45 / 50

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

46 / 50

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

47 / 50

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

48 / 50

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

49 / 50

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

50 / 50

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

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