Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
11th Edition
ISBN: 9780134670942
Author: Y. Daniel Liang
Publisher: PEARSON
Question
Book Icon
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”.

Expert Solution & Answer
Check Mark
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]

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
do both
Use the custom-designed Hash class to create the computing terminology glossary application. Experiment with various hash algorithms and collision-resolution methods.
The hash table array has capacity of 10. Capacity is the number of slots present in the array that is used to build the hashtable. The hash function returns the absolute value of the key mod the capacity of the hash table. a) Insert these keys in the hash table: 3,23,11,21,1,7,77,8 where the hash table uses quadratic probing to resolve collisions. b) Search and Delete 3 and 11 from the table. Be careful about changing the status of the table slot to “deleted” after deleting each item. c)Search 23 and 21 from the table and print their position.
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education