# July 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 following:
o Fibonacci Heaps
o Binomial Heaps

10 marks

2. If
2
) (
3
n
n f = , 17 120 37 ) (
2
+ + = n n n g then show that ) ( f O g e and ) (g O f e
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,
|
.
|

\
| +
s
2
1
log
n
h
t
. 10 marks

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

6. Explain Kruskal’s Algorithm.

10 marks

July 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. Describe the following with suitable examples for each:
o Binary Search Trees
o Red Black Trees

10 marks

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

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

4. If L
1
and L
2
are context- free languages, then L
1
L
2
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

Explain the concept of transition diagrams with examples wherever necessary.July 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 : 1. 10 marks 6. Give an algorithm for Greedy Knapsack problem. Explain prim’s Algorithm. Show that R  RS  S  a bS  . Analyse your algorithm? . 10 marks 5. Describe the following with suitable examples for each: o Binary Search Trees o Red Black Trees 10 marks 2. 10 marks 610 = 6 3. If L1 and L2 are context.free languages. then L1  L2 is a context free language. 10 marks 4. where R  b  aab and S is any regular expression.

10 marks .

Sign up to vote on this title