TRUCTION: make this a flowchart import java.util.HashSet; import java.util.Set; public class elements { public static void main(String[] args) { Set A = new HashSet<>(); A.add("one"); A.add("two"); A.add("three"); A.add("four"); Set B = new HashSet<>(); B.add("two"); B.add("three"); B.add("five"); B.add("six"); System.out.println("A: " + A); System.out.println("B: " + B); unionOp(A, B); intersectionOp(A, B); differenceOp(A, B); checkSubset(A, B); } public static void unionOp(Set A, Set B) { // To perform union Set AUnionB = new HashSet<>(A); AUnionB.addAll(B); System.out.println("A union B: " + AUnionB); } public static void intersectionOp(Set A, Set B) { // To perform Intersection Set AIntersectionB = new HashSet<>(A); AIntersectionB.retainAll(B); System.out.println("A intersection B: " + AIntersectionB); } public static void differenceOp(Set A, Set B) { // To find difference Set ADifferenceB = new HashSet<>(A); ADifferenceB.removeAll(B); Set BDifferenceA = new HashSet<>(B); BDifferenceA.removeAll(A); System.out.println("A difference B: " + ADifferenceB); System.out.println("B difference A: " + BDifferenceA); } public static void checkSubset(Set A, Set B) { // To check for subset System.out.println("B is subset A: " + A.containsAll(B)); System.out.println("A is subset B: " + B.containsAll(A));

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

INSTRUCTION: make this a flowchart import java.util.HashSet; import java.util.Set; public class elements { public static void main(String[] args) { Set A = new HashSet<>(); A.add("one"); A.add("two"); A.add("three"); A.add("four"); Set B = new HashSet<>(); B.add("two"); B.add("three"); B.add("five"); B.add("six"); System.out.println("A: " + A); System.out.println("B: " + B); unionOp(A, B); intersectionOp(A, B); differenceOp(A, B); checkSubset(A, B); } public static void unionOp(Set A, Set B) { // To perform union Set AUnionB = new HashSet<>(A); AUnionB.addAll(B); System.out.println("A union B: " + AUnionB); } public static void intersectionOp(Set A, Set B) { // To perform Intersection Set AIntersectionB = new HashSet<>(A); AIntersectionB.retainAll(B); System.out.println("A intersection B: " + AIntersectionB); } public static void differenceOp(Set A, Set B) { // To find difference Set ADifferenceB = new HashSet<>(A); ADifferenceB.removeAll(B); Set BDifferenceA = new HashSet<>(B); BDifferenceA.removeAll(A); System.out.println("A difference B: " + ADifferenceB); System.out.println("B difference A: " + BDifferenceA); } public static void checkSubset(Set A, Set B) { // To check for subset System.out.println("B is subset A: " + A.containsAll(B)); System.out.println("A is subset B: " + B.containsAll(A)); } }

Expert Solution