Chapter 21, Problem 21.1PE

Program Plan Intro

SetOperation.java

Program Plan:

• Include the class name named “SetOperation”.
  • Import java array class from util package.
  • Import java linkedhash set class from util package.
  • Import the set interface.
  • Define class.
  • Declare the main()method.
  • Create linked list Hash set set1 and assign name of person as values.
  • Create another linked list Hash set set2 and assign name of person as values.
  • Display the union of the two sets set1 and set2 using addAll() function and print the result.
  •  Display the difference of the two sets by calling the removeAll function and print the result.
  • Display the intersection of the two sets and print the result.
  • Close the main method.
• Close the class “SetOperation”.

Program Description Answer

The below java code to create two sets and assign person’s name to them and then perform set union, difference and intersection of the two sets.

Explanation of Solution

Program:

//import java array class from util package

import java.util.Arrays;

//import java linkedlist hash set class from util package

import java.util.LinkedHashSet;

//import the set interface

import java.util.Set;

//class Definition

public class SetOperation {

// main method

public static void main(String[] args) {

/* create linked list hash set Set1 and assign name of person as values */

Set<String> set1 = new LinkedHashSet<>(Arrays.asList("George", "Jim",

"John", "Blake", "Kevin", "Michael"));

/*Create another linked list hash set Set2 and assign name of person as values */

Set<String> set2 = new LinkedHashSet<>(Arrays.asList("George", "Katie","Kevin", "Michelle", "Ryan"));

/* Display the union of the two sets set1 and set2 using addAll function */

Set<String> union = new LinkedHashSet<>(set1);

union.addAll(set2);

// print the union results

System.out.println("Union of the two sets: " + union);

/* Display the difference of the two sets by calling the removeAll function

*/

Set<String> difference = new LinkedHashSet<>(set1);

difference.removeAll(set2);

// print the difference of two sets

System.out.println("Difference of the two sets: " + difference);

// Display the intersection of the two sets

Set<String> intersection = new LinkedHashSet<>();

/*

Check for the elements that are present in set 2 and also present in

* set 1

*/

for (String e : set2) {

if (set1.contains(e))

intersection.add(e);

}

// print the intersection of two sets

System.out.println("Intersection of the two sets: " + intersection);

}

}

Sample Output

Union of the two sets: [George, Jim, John, Blake, Kevin, Michael, Katie, Michelle, Ryan]

Difference of the two sets: [Jim, John, Blake, Michael]

Intersection of the two sets: [George, Kevin]