- A set is a collection of well defined elements. The members of a set are all different.
- A set ADT can be defined to comprise the following operations:
- 1.
- Union (A, B, C)
- 2.
- Intersection (A, B, C)
- 3.
- Difference (A, B, C)
- 4.
- Merge (A, B, C)
- 5.
- Find (x)
- 6.
- Member (x, A) or Search (x, A)
- 7.
- Makenull (A)
- 8.
- Equal (A, B)
- 9.
- Assign (A, B)
- 10.
- Insert (x, A)
- 11.
- Delete (x, A)
- 12.
- Min (A) (if A is an ordered set)

- Set implementation: Possible data structures include:
- Bit Vector
- Array
- Linked List
- Unsorted
- Sorted

eEL,CSA_Dept,IISc,Bangalore