CS301 Assignment # 6

Assignment:
 
Q. 1 Consider the following nodes (10 Marks)

Make forest of two union trees, also write node in array according to trees.

2. A. What is Disjoint Sets? How much operation could be performed on Disjoint sets?
(5 Marks)

2. B.  What is Dynamic Equivalence Problem? Explain with matrix example.     (5 Marks)