CS502 Midterm Online Quiz

0%

CS502-Midterm

1 / 50

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

2 / 50

In 2d-space a point is said to be ________if it is not dominated by any other point in that space.

3 / 50

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

4 / 50

One Example of in place but not stable sort is

5 / 50

The O-notation is used to state only the asymptotic ________bounds.

6 / 50

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

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

8 / 50

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

9 / 50

Which may be stable sort:

10 / 50

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

11 / 50

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

12 / 50

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

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

14 / 50

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

15 / 50

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

16 / 50

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

17 / 50

Is it possible to sort without making comparisons?

18 / 50

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

19 / 50

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

20 / 50

Efficient algorithm requires less computational…….

21 / 50

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

22 / 50

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

23 / 50

In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.

24 / 50

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

25 / 50

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

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

27 / 50

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

28 / 50

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

29 / 50

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

30 / 50

One example of in place but not stable algorithm is

31 / 50

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

32 / 50

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

33 / 50

In Quick sort, we don’t have the control over the sizes of recursive calls

34 / 50

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

35 / 50

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

36 / 50

For the sieve technique we solve the problem,

37 / 50

______________ graphical representation of algorithm.

38 / 50

In Heap Sort algorithm, if heap property is violated _________

39 / 50

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

40 / 50

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

41 / 50

Which may be a stable sort?

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

43 / 50

Slow sorting algorithms run in,

44 / 50

_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.

45 / 50

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

46 / 50

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

47 / 50

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

48 / 50

Sieve Technique can be applied to selection problem?

49 / 50

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

50 / 50

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

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