HW05_sln

# HW05_sln - CSE310 HW05 Thursday Due Thursday A Please note...

This preview shows pages 1–2. Sign up to view the full content.

CSE310 HW05, Thursday, 04/01/2010, Due: Thursday, 04/08/2010 Please note that you have to typeset your assignment using either L A T E X or Microsoft Word. Hand-written assignment will not be graded. You need to submit a hardcopy before the lecture on the due date. You also need to submit an electronic version at the digital drop box. For the electronic version, you should name your ﬁle using the format HW05-LastName-FirstName. 1. (10 pts) Suppose you are initially given 8 singleton sets, each containing the numbers 1 , 2 ,..., 8, respectively. Show the array structure of the sets (you have to show the rank of each root node). Solution: i | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | ----------------------------------- A | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | Grading Keys: 5 pts for correct solution. Now we perform Union ( 1 , 2 ), Union ( 3 , 4 ) and Union ( 2 , 4 ), in that order. Show the array structure of the sets (you have to show the rank of each root node) after these operations are performed.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 02/27/2011 for the course CSE 310 taught by Professor Davulcu,h during the Spring '08 term at ASU.

### Page1 / 4

HW05_sln - CSE310 HW05 Thursday Due Thursday A Please note...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online