CS502 Midterm Online Quiz

0%

CS502-Midterm

1 / 50

Floor and ceiling are ____________ to calculate while analyzing algorithms.

2 / 50

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

3 / 50

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

4 / 50

What is the total time to heapify?

5 / 50

In which order we can sort?

6 / 50

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

7 / 50

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

8 / 50

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

9 / 50

Is it possible to sort without making comparisons?

10 / 50

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

11 / 50

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

12 / 50

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

13 / 50

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

14 / 50

One example of in place but not stable algorithm is

15 / 50

The sieve technique works in ___________ as follows

16 / 50

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

17 / 50

For the heap sort we store the tree nodes in

18 / 50

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

19 / 50

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

20 / 50

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

21 / 50

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

22 / 50

_______________ is a graphical representation of an algorithm

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

24 / 50

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

25 / 50

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

26 / 50

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

27 / 50

One Example of in place but not stable sort is

28 / 50

Upper bound requires that there exist positive constants c2 and n0 such that f(n) ____ c2n for all n <= n0(ye question ghalat lag raha hai mujhae

29 / 50

Analysis of Selection algorithm ends up with,

30 / 50

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

31 / 50

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

32 / 50

What is the total time to heapify?

33 / 50

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

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

35 / 50

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

36 / 50

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

37 / 50

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

38 / 50

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

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

40 / 50

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

41 / 50

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

42 / 50

For the Sieve Technique we take time

43 / 50

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

44 / 50

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

45 / 50

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

46 / 50

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

47 / 50

Random access machine or RAM is a/an

48 / 50

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

49 / 50

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

50 / 50

Efficient algorithm requires less computational…….

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