Wednesday, January 18, 2012

Data Structures CS301 Assignment No 05 SEMESTER fall January 2011-2012

Question No.1 (5+5 Marks)

Consider the following array as input

13

4

6

8

9

7

10

15

I) Prove that it is a heap and also explain what type of heap it is.?

II) Add 16 and 3 into the heap and convert it into Max heap.

Question No: 2 Marks: 10

Perform the following sequence of Union operations on the set of elements {1,2,3,4,5,6,7,8,9,10,11} using Union by Size.

Union(1,2)

Union(3,5)

Union(3,6)

Union(1,4)

Union(3,9)

Union(10,11)

Union(1,10)

Union(7,8)

Union(10,7)

Union(1,3) .

Vugurus. Powered by Blogger.

Popular Posts

Blog Archive

Labels

Imp Links

Followers

Total Pageviews

Subscribe for email

Blog Archive

Labels

Search

Loading...

About Me