The exercise consists of Hashing. Note you are not allowed to rely on Java library classes in your implementation. Part 3 Implement in Java a function that takes as input an integer n  2 and generates n different strings all hashing to the same value when the following hash function is used. public int hashCode(String s) { int hash = 0; int skip = Math.max(1, s.length() / 3); for (int i = 0; i < s.length(); i += skip) hash = (hash * 37) + s.charAt(i); return hash; } Assume ASCII characters. and please Briefly describe your implementation

The exercise consists of Hashing. Note you are not allowed to rely on Java library classes in your implementation. Part 3 Implement in Java a function that takes as input an integer n  2 and generates n different strings all hashing to the same value when the following hash function is used. public int hashCode(String s) { int hash = 0; int skip = Math.max(1, s.length() / 3); for (int i = 0; i < s.length(); i += skip) hash = (hash * 37) + s.charAt(i); return hash; } Assume ASCII characters. and please Briefly describe your implementation

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

Java Programming: There are lots of errors in this code. Please help me fix them. Attached is images of what the code must have and circled the errors in the code. Interpreter.java public class Interpreter { private HashMap<String, Object> variables; public void interpretFunction(FunctionNode fn) { // Create a hash map for local variables variables = new HashMap<String, Object>(); for(Node constantNode : fn.getConstants()) { Object constant = constantNode.getValue(); variables.put(constantNode.getName(), constant); } for(Node localVarNode : fn.getVariables()) { Object localVar = null; variables.put(localVarNode.getName(), localVar); } interpretBlock(fn.getStatements(), variables); } public void interpretBlock(List<StatementNode> statementNodes, HashMap<String, Object> variables) { for(StatementNode statement : statementNodes) {…
import java.util.HashSet; import java.util.Set; // Define a class named LinearSearchSet public class LinearSearchSet { // Define a method named linearSearch that takes in a Set and an integer target // as parameters public static boolean linearSearch(Set<Integer> set, int target) { // Iterate over all elements in the Set for () { // Check if the current value is equal to the target if () { // If so, return true } } // If the target was not found, return false } // Define the main method public static void main(String[] args) { // Create a HashSet of integers and populate integer values Set<Integer> numbers = new HashSet<>(); // Define the target to search for numbers.add(3); numbers.add(6); numbers.add(2); numbers.add(9); numbers.add(11); // Call the linearSearch method with the set…
INSTRUCTION: make this a flowchart import java.util.HashSet;import java.util.Scanner;import java.util.Set; public class elements { public static void main(String args[]) { Scanner sc = new Scanner(System.in); // Creating two sets Set<Integer> set1 = new HashSet<Integer>(); Set<Integer> set2 = new HashSet<Integer>(); System.out.println("Enter the element of set A [max-5 elements]: "); for (int i = 0; i < 5; i++) { int num = sc.nextInt(); set1.add(num); } System.out.println("Enter the element of set B [max-5 elements]: "); for (int i = 0; i < 5; i++) { int num1 = sc.nextInt(); set2.add(num1); } // creating a menu of opeartions System.out.println("a. Identify elements of set"); System.out.println("b. Check Union"); System.out.println("c. Check Difference"); System.out.println("d. Check Intersection"); System.out.println("e. Check Subset"); System.out.println("f. If set A and B are…
Apply the methods in the ListIterator interface to write a Java program in NetBeans that creates a LinkedList of four elements of type string, namely: Java, C#, PHP and Python.The program should then print out the elements initially in the original order, and then afterwards in reverse order using the ListIterator methods. In this case, the following is the expected output: Run: original order of strings: Java C# PHP Python Reverse order of strings: Python PHP C#Java BUILD SUCCESSFUL
- In class HashTable implement a hash table and consider the following:(i) Keys are integers (therefore also negative!) and should be stored in the tableint[] data.(ii) As a hash function take h(x) = (x · 701) mod 2000. The size of the table istherefore 2000. Be careful when computing the index of a negative key. Forexample, the index of the key x = −10 ish(−10) = (−7010) mod 2000 = (2000(−4) + 990) mod 2000 = 990.Hence, indices should be non-negative integers between 0 and 1999!(iii) Implement insert, which takes an integer and inserts it into a table. Themethod returns true, if the insertion is successful. If an element is already inthe table, the function insert should return false.(iv) Implement search, which takes an integer and finds it in the table. The methodreturns true, if the search is successful and false otherwise.(v) Implement delete, which takes an integer and deletes it form the table. Themethod returns true, if the deletion is successful and false otherwise.(vi)…
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…
Java Program, Dont Copy Consider a class Student that has an attribute age and a method getAge(): StudentList is a class representing a linkedlist of students. Write sumListAge_lterative......), a method that computes and returns the sum of the ages of all students in the list using the iterative way. Parameters of the method should be specified accordingly
fast please c++ Insert the elements of A in hash table H of size 10. H is a vector of int is size 10. Do not allow duplicates. Draw the table. The hash function is the number itself; f(n) = n%10
Computer Science ** In JAVA** What would a generic radix sorter look like that computed the same function on Strings as my EXAMPLE (below), that checks true, or throw an exception….? EXAMPLE: StringComparator.java import java.util.Comparator; public class StringComparator implements Comparator { @Override public int compare(String s1, String s2) { return s1.toLowerCase().compareTo(s2.toLowerCase()); } } HeapSort.java import java.util.ArrayList; import java.util.Comparator; public class HeapSort { public void sortingHeapTree(ArrayList arr, Comparator c) { int n = arr.size(); for (int i = n / 2 - 1; i >= 0; i--) HeapTreeConstruction(arr, n, i, c); for (int i = n - 1; i >= 0; i--) { T temp = arr.get(0); arr.set(0, arr.get(i)); arr.set(i, temp); HeapTreeConstruction(arr, i, 0, c); } } void HeapTreeConstruction(ArrayList arr, int n, int i, Comparator c) { int root = i; // Initialize largest as root int l = 2 * i + 1; // left = 2*i + 1 int r = 2 * i + 2; // right = 2*i + 2 if…
Please enter the following code into a Java file. import java.util.*; public class SetDemo { int count[] public static void main(String args[]) { {34, 22,10,60,30,22}; Set unsortedSet = new HashSet(); try { for(int i = 0; i (unsortedSet); System.out.println("The sorted set is: System.out.println("The System.out.println("The catch(Exception e) {} + sorted Set); first element of the set is: "+ (Integer) sorted Set.first()); last element of the set is: "+ (Integer)sortedSet.last()); Run the program to confirm it works as expected. Then, expand the program to do the following steps in order. For each test, display the result of the test to the console.
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
Java Program: There are errors in the lexer and shank file. Please fix those errors and there must be no error in any of the code at all. Below is the lexer, shank, and token files. The shank file is the main method. There is a rubric attached as well. Lexer.java import java.util.ArrayList;import java.util.HashMap;import java.util.List; import mypack.Token.TokenType; public class Lexer { private static final int INTEGER_STATE = 1;private static final int DECIMAL_STATE = 2;private static final int IDENTIFIER_STATE = 3;private static final int SYMBOL_STATE = 4;private static final int ERROR_STATE = 5;private static final int STRING_STATE = 6;private static final int CHAR_STATE = 7;private static final int COMMENT_STATE = 8; private static final char EOF = (char) -1; private static String input;private static int index;private static char currentChar;private static int lineNumber = 1;private static int indentLevel = 0;private static int lastIndentLevel = 0; private static…