what are disjoint sets?

Answer 1

Disjoint sets have no common elements. A good way to see this is through the use of a Venn diagram which represents the sets as circles. If the sets are disjoint, they will not overlap at all.

Answer 2

When no two elements of a set are common, the sets are known to be disjoint. For example set of blue balls and red balls is a disjoint set

Answer 3

Given a set of elements, it is often useful to break them up or partition them into a number of separate, nonoverlapping groups. A disjoint-set data structure is a data structure that keeps track of such a partitioning. A union-find algorithm is an algorithm that performs two useful operations on such a data structure:

Find: Determine which group a particular element is in. Also useful for determining if two elements are in the same group.
Union: Combine or merge two groups into a single group.
Because it supports these two operations, a disjoint-set data structure is sometimes called a merge-find set. The other important operation, MakeSet, which makes a group containing only a given element (a singleton), is generally trivial. With these three operations, many practical partitioning problems can be solved (see the Applications section).

In order to define these operations more precisely we need some way of representing the groups. One common approach is to select a fixed element of each group, called its representative, to represent the group as a whole. Then, Find(x) returns the representative of the group that x belongs to, and Union takes two group representatives as its arguments.

Answer 4

2 sets are disjoint if they have no elements in common.

Answer 5

two sets are set to be disjoint when there is no element in common.they are independent and mutually exclusive