Set operations in MyHashSet Program Plan: Include a class name named “Exercise_11”. Import util package. Declare the main() method. Declare constructor. Create array for string names. Take user inputs and add into respective arrays. Create new Hashset. Add elements from set1 into set2. Remove all elements present in set1 from set 2. Retain elements present in set2 and set1. Check if set1 and set2 contains same elements. Close the main() method. Close the class. Include a static class “MyHashSet”. Define the default hash table size. Must be a power of 2. Define the maximum hash table size. 1 << 30 is same as 2^30. Declare current hash table capacity. Capacity is a power of 2. Define default load factor. Specify a load factor threshold used in the hash table. Declare a Hash table that is an array with each cell that is a linked list. Declare a constructor to Construct a set with the default capacity and load factor. Declare a constructor to Construct a set with the specific capacity and load factor. Declare an override method that Remove all elements from this set. Declare an override method that Return true if the element is in the set. Declare an override method that adds an element to the set. Create a linked list for the bucket if it is not created. Declare an override method that Remove the element from the set. Declare an override method that Return the number of elements in the set. Declare an override method to return the number of iterators.

Question

Want to see the full answer?

Answer 1

Question

Chapter 27, Problem 27.11PE

Program Plan Intro

Set operations in MyHashSet

Program Plan:

Include a class name named “Exercise_11”.

Import util package.

Declare the main() method.

Declare constructor.

Create array for string names.

Take user inputs and add into respective arrays.

Create new Hashset.

Add elements from set1 into set2.

Remove all elements present in set1 from set 2.

Retain elements present in set2 and set1.

Check if set1 and set2 contains same elements.

Close the main() method.

Close the class.

Include a static class “MyHashSet”.

Define the default hash table size. Must be a power of 2.

Define the maximum hash table size. 1 << 30 is same as 2^30.

Declare current hash table capacity. Capacity is a power of 2.

Define default load factor.

Specify a load factor threshold used in the hash table.

Declare a Hash table that is an array with each cell that is a linked list.

Declare a constructor to Construct a set with the default capacity and load factor.

Declare a constructor to Construct a set with the specific capacity and load factor.

Declare an override method that Remove all elements from this set.

Declare an override method that Return true if the element is in the set.

Declare an override method that adds an element to the set.

Create a linked list for the bucket if it is not created.

Declare an override method that Remove the element from the set.

Declare an override method that Return the number of elements in the set.

Declare an override method to return the number of iterators.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Objective: 1. Implement a custom Vector class in C++ that manages dynamic memory efficiently. 2. Demonstrate an understanding of the Big Five by managing deep copies, move semantics, and resource cleanup. 3. Explore the performance trade-offs between heap and stack allocation. Task Description: Part 1: Custom Vector Implementation 1. Create a Vector class that manages a dynamically allocated array. 。 Member Variables: ° T✶ data; // Dynamically allocated array for storage. std::size_t size; // Number of elements currently in the vector. std::size_t capacity; // Maximum number of elements before reallocation is required. 2. Implement the following core member functions: Default Constructor: Initialize an empty vector with no allocated storage. 。 Destructor: Free any dynamically allocated memory. 。 Copy Constructor: Perform a deep copy of the data array. 。 Copy Assignment Operator: Free existing resources and perform a deep copy. Move Constructor: Transfer ownership of the data array…

2.68♦♦ Write code for a function with the following prototype: * Mask with least signficant n bits set to 1 * Examples: n = 6 -> 0x3F, n = 17-> 0x1FFFF * Assume 1 <= n <= w int lower_one_mask (int n); Your function should follow the bit-level integer coding rules Be careful of the case n = W.

Hi-Volt Components You are the IT manager at Hi-Voltage Components, a medium-sized firm that makes specialized circuit boards. Hi-Voltage's largest customer, Green Industries, recently installed a computerized purchasing sys- tem. If Hi-Voltage connects to the purchasing system, Green Industries will be able to submit purchase orders electronically. Although Hi-Voltage has a computerized accounting system, that system is not capable of handling EDI. Tasks 1. What options does Hi-Voltage have for developing a system to connect with Green Industries' pur- chasing system? 2. What terms or concepts describe the proposed computer-to-computer relationship between Hi-Voltage and Green Industries? why not? 3. Would Hi-Voltage's proposed new system be a transaction processing system? Why or 4. Before Hi-Voltage makes a final decision, should the company consider an ERP system? Why or why not?