CS502 Midterm Online Quiz

0%

CS502-Midterm

1 / 50

A RAM is an idealized machine with ______________ random-access memory.

2 / 50

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

3 / 50

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

4 / 50

What is the total time to heapify?

5 / 50

______________ graphical representation of algorithm.

6 / 50

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

7 / 50

Sieve Technique can be applied to selection problem?

8 / 50

The Knapsack problem belongs to the domain of _______________ problems.

9 / 50

For the heap sort we store the tree nodes in

10 / 50

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

11 / 50

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

12 / 50

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

13 / 50

In Heap Sort algorithm, if heap property is violated _________

14 / 50

Slow sorting algorithms run in,

15 / 50

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

16 / 50

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

17 / 50

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

18 / 50

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

19 / 50

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

20 / 50

_______________ is a graphical representation of an algorithm

21 / 50

The sieve technique works in ___________ as follows

22 / 50

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

23 / 50

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

24 / 50

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

25 / 50

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

26 / 50

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

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

28 / 50

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

29 / 50

Floor and ceiling are ____________ to calculate while analyzing algorithms.

30 / 50

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

31 / 50

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

32 / 50

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

33 / 50

Which may be a stable sort?

34 / 50

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

35 / 50

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

36 / 50

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

37 / 50

Random access machine or RAM is a/an

38 / 50

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

39 / 50

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

40 / 50

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

41 / 50

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

42 / 50

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

43 / 50

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

44 / 50

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

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

46 / 50

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

47 / 50

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

48 / 50

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

49 / 50

Which may be stable sort:

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

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