CS301 Data Structures Assignment No. 7 Solution Fall Semester 2013

[Vuhelper]

CS301 Data Structures Assignment No. 7 Solution Fall Semester 2013 Due Date 6/02/2013



Assignment No. 07
SEMESTER Fall 2012
CS301- Data Structures




Total Marks: 20



Due Date: 06-02-2013

Instructions

Please read the following instructions carefully before solving & submitting assignment:

It should be clear that your assignment will not get any credit (zero marks) if:

The assignment is submitted after due date.
The submitted assignment is other than .Doc file.
The submitted assignment does NOT open or file is corrupted.
The assignment is copied (from other student or ditto copy from handouts or internet).

Uploading instructions

For clarity and simplicity, You are required to Upload/Submit only .Doc file

Objective

The objective of this assignment is

To make you familiar with the concept of Disjoint-set (Union-Find) Data Structure.

For any query about the assignment, contact at

GOOD LUCK

Assignment Statement: Marks: 20

Consider the following 11 nodes:
Apply union operation on the above nodes in such a way that:

Node ‘E’ and node ‘F’ are connected to node ‘B’.
Nodes ‘H’ and ‘G’ are connected to node ‘E’, whereas node ‘k’ has a connection to node ‘F’.
Node ‘L’, ‘M’, and ‘N’ provides a connection to Node ‘K’.
Node ‘O’ has a connection to node ‘G’ and node ‘P’ has a connection to node ‘M’.

Solution Guidelines:

1. Perform Union operation on these nodes in such a way that at the end of all union operations, there is a forest showing all connections to node ‘B’.

You have to perform single union operation at one time.
You are required to show the union operations performed at each step.

Lectures Covered: This assignment covers Lecture # 34-37.

Deadline:Your assignment must be uploaded/submitted at or before , February 06, 2013