CS 2251-DESIGN & ANALYSIS OF ALGORITHM

CONTINUOUS INTERNAL ASSESSMENT TEST – I

CS 2251-DESIGN & ANALYSIS OF ALGORITHM

IV SEM – B.E(CSE)

TIME: 90 MINUTES                        DATE OF EXAM:18/01/2011                                   SESSION  : A.N                                          MAX.MARKS: 50

                      

PART A (Answer All Questions)                                    10 X 2 = 20

1.      Define algorithm.

2.      How to measure the algorithm ‘s efficiency?

3.      Define asymptotic notation.

4.      Differentiate linear search and binary search.

5.      Differentiate exact Vs approximate algorithm.

6.      Draw the tree of recursive calls for computing the Fibonacci number for n=5.

7.      What is meant by divide and conquer technique.

8.      What is the advantage of merge sort algorithm.

9.      What are the drawbacks of binary search algorithm.

10.  List and explain the properties of sorting algorithm.

PART B (Answer Any Three Questions)                       3 X 10 = 30

11.  Explain in detail about design and analysis of an algorithm.

12.   Explain the analysis framework of algorithms with suitable examples.

13.  Explain in detail about asymptotic notations with examples.