Problem 6: Disjoint sets. Let operations Union() and Find-Set() be efficient: that means sets are implemented by trees, the name of the new set is always the name of the deepest set, and when finding a representative of the set employs the path compression on its way up. (i) On the set of disjoint sets {{1}, {2}, . . . , {10}} we perform the following sequence of operations: Union(1, 3), Union(4, 5), Union(6, 1), Union(6, 3), Union(7, 8), Union(10, 9), Union(3, 10), Find-Set(2), Find-Set(10), Find-Set(9) and Find-Set(8). Draw your data structure after the last Union() operation and after each of the Find-Set() operations. (ii) On the set of disjoint sets {{1}, {2}, . . . , {n}} perform n − 1 Union() operations such that the first Find-Set() operation will be as slow as possible. Write down the sequence of Union() operations and the element of the first Find-Set() operation. Elaborate. Hint: How slow the operation Find-Set() can be

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Problem 6: Disjoint sets. Let operations Union() and Find-Set() be efficient: that
means sets are implemented by trees, the name of the new set is always the name of the
deepest set, and when finding a representative of the set employs the path compression on
its way up.
(i) On the set of disjoint sets {{1}, {2}, . . . , {10}} we perform the following sequence of
operations:
Union(1, 3), Union(4, 5), Union(6, 1), Union(6, 3), Union(7, 8), Union(10, 9),
Union(3, 10), Find-Set(2), Find-Set(10), Find-Set(9) and Find-Set(8).
Draw your data structure after the last Union() operation and after each of the
Find-Set() operations.
(ii) On the set of disjoint sets {{1}, {2}, . . . , {n}} perform n − 1 Union() operations
such that the first Find-Set() operation will be as slow as possible. Write down the
sequence of Union() operations and the element of the first Find-Set() operation.
Elaborate.
Hint: How slow the operation Find-Set() can be

Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Types of trees
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education