CS502 Midterm Online Quiz

0%

CS502-Midterm

1 / 50

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

2 / 50

In Heap Sort algorithm, if heap property is violated _________

3 / 50

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

4 / 50

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

5 / 50

Counting sort has time complexity:

6 / 50

The sieve technique works in ___________ as follows

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

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

9 / 50

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

10 / 50

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

11 / 50

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

12 / 50

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

13 / 50

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

14 / 50

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

15 / 50

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

16 / 50

One example of in place but not stable algorithm is

17 / 50

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

18 / 50

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

19 / 50

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

20 / 50

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

21 / 50

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

22 / 50

In which order we can sort?

23 / 50

What is the total time to heapify?

24 / 50

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

25 / 50

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

26 / 50

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

27 / 50

In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.

28 / 50

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

29 / 50

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

30 / 50

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

31 / 50

______________ graphical representation of algorithm.

32 / 50

In RAM model instructions are executed

33 / 50

Sorting can be in _________

34 / 50

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

35 / 50

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

36 / 50

The Knapsack problem belongs to the domain of _______________ problems.

37 / 50

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

38 / 50

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

39 / 50

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

40 / 50

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

41 / 50

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

42 / 50

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

43 / 50

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

44 / 50

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

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

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.

47 / 50

Is it possible to sort without making comparisons?

48 / 50

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

49 / 50

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

50 / 50

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

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