CS502 Midterm Online Quiz

0%

CS502-Midterm

1 / 50

For the sieve technique we solve the problem,

2 / 50

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

3 / 50

For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.

4 / 50

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

5 / 50

Counting sort has time complexity:

6 / 50

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

7 / 50

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

8 / 50

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

9 / 50

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

10 / 50

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

11 / 50

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

12 / 50

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

13 / 50

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

14 / 50

One example of in place but not stable algorithm is

15 / 50

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

16 / 50

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

17 / 50

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

18 / 50

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

19 / 50

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

20 / 50

In Heap Sort algorithm, if heap property is violated _________

21 / 50

Which may be a stable sort?

22 / 50

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

23 / 50

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

24 / 50

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

25 / 50

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

26 / 50

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

27 / 50

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

28 / 50

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

29 / 50

Efficient algorithm requires less computational…….

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

31 / 50

Quick sort is

32 / 50

_______________ is a graphical representation of an algorithm

33 / 50

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

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

35 / 50

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

36 / 50

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

37 / 50

Analysis of Selection algorithm ends up with,

38 / 50

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

39 / 50

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

40 / 50

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

41 / 50

In RAM model instructions are executed

42 / 50

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

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

44 / 50

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

45 / 50

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

46 / 50

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

47 / 50

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

48 / 50

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

49 / 50

Which may be stable sort:

50 / 50

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

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