February 2011

Master of Computer Application (MCA) – Semester 4

MC0080 – Analysis and Design of Algorithms – 4 Credits
(Book ID: B0891)
Assignment Set – 1 (60 Marks)

Answer the following : 6× 10 = 6

1. Describe the characteristics of algorithms? Explain the procedure and recursion in
algorithm? 10 marks

n3
2. If f ( n) = , g ( n) =37 n 2 +120 n +17 then show that g ∈O ( f ) and f ∉O (g )
2
10 marks

3. Explain the concept of bubble sort and also write the algorithm for bubble sort.
10 marks

4. Prove that “If n ≥ 1, then for any n-key, B-tree T of height hand minimum degree t ≥ 2,

 n +1
h ≤ log t  . 10 marks
 2 

5. Explain briefly the concept of breadth-First search(BFS) 10 marks

6. Explain Kruskal’s Algorithm.

10 marks
 February 2011
Master of Computer Application (MCA) – Semester 4
MC0080 – Analysis and Design of Algorithms – 4 Credits
(Book ID: B0891)
Assignment Set – 2 (40 Marks)

Answer the following : 6× 10 = 6

1. Briefly explain chained matrix multiplication
10 marks

2. Show that R + RS ∗S = a ∗bS ∗ , where R = b + aa ∗b and S is any regular expression.

10 marks

3. Explain the concept of transition diagrams with examples wherever necessary.

10 marks

4. If L1 and L2 are context- free languages, then L1 ∪ L2 is a context free language.

10 marks

5. Explain prim’s Algorithm.

10 marks

6. Give an algorithm for Greedy Knapsack problem. Analyse your algorithm?

10 marks