Given a hash table of size M=10 and a linear probing method, following are the contents of the hash table: [-1, 41, 71, -1, 64, 75, 84, -1, 88, 9]. -1 indicates slot is empty. Use the standard hash function: h(x)=x%M Match the index on the left with the value on the right for the hash table after the following operations are carried out in the given order: delete(88) delete(41) delete(44) insert(108) insert(71)

Assume that linear probing is used for hash-tables. To improve the time complexity of the operations performed on the table, a special AVAILABLE object is used to mark a location when an item is removed from the location. Assuming that all keys are positive integers, the following two techniques were suggested instead of marking the location as AVAILABLE: i) When an entry is removed, instead of marking its location in the table as AVAILABLE, indicate the key in the location as the negative value of the removed key (e.g., if the removed key was 16, indicate the key as -16). Searching for an entry with the removed key would then terminate once a negative value of the key is found (instead of continuing to search if AVAILABLE is used). ii) Instead of using AVAILABLE, find a key in the table that should have been placed in the location of the removed entry, then place that key (the entire entry of course) in that location (instead of setting the location as AVAILABLE). The motive is to…

Task - 1: Write a java program to implement the following algorithms for Open Addressing techniques for Hash Table data structure. (Use a simple array of integers to store integer key values only). HASH-SEARCH(T, k) HASH-INSERT (T, k) i = 0 repeat j = h (k, i) if T[j] == NIL T[j] = k return j else i = i + 1 ● i = 0 repeat until i == m error “hash table overflow" For both algorithms, to compute the index j, write the following methods: getLinear ProbIndex (key, i) getQuadraticProbIndex ● get DoubleHash (key, i) (key, i) j = h (k, i) if T[j] == k return j i = i + 1 until T[j] == NIL or i = m return NIL Linear Probing index is computed using following hash function: h(k, i) = (h₁(k) + i) mod m h₁(k)= k mod m Quadratic probing index is computed using following hash function: h(k, i) = (h₁(k) + i²) mod m h₁(k)= k mod m Double hashing index is computed using following hash function: h(k, i) = (h₁(k) + i h₂(k)) mod m h₁(k)= k mod m h₂(k) = 1 + (k mod m - 1)

Given two arrays of integers, write a function to find the intersection of the arrays. The intersection should include only distinct elements and the result should be in sorted order. Solve this problem using the hash set approach.

Like numbers, strings can also be used as keys in a hash functions. A hash function for any string s="abc" can be defined as: Hash(abc) = (a + b + c) % tableSize Consider the following ASCII table for different alphabets and use the hash function to create a hash table of 10 slots for the following Names using Open addressing (Linear probing to resolve collision). Names: ahmed, samir, saad, yazeed, raed, sultan, salman, azzam, saleh, hamad. Explain the steps showing your work in detail. a 97 m 109 y 121 b 98 n 110 Z 122 с 99 O 111 d 100 Р 112 e 101 q 113 f 102 r 114 g 103 S 115 h i j 104 105 106 t 116 k 107 u V W 117 118 119 I 108 X 120

Use the hash function h(x) =x mod 11 to load the following values 25, 14, 36, 47 using separate chaining.

). This problem is about the chaining method we discussed in the class. Problem 3 (, Consider a hash table of size N = 11. Suppose that you insert the following sequence of keys to an initially empty hash table. Show, step by step, the content of the hash table. Sequence of keys to be inserted:

1. Given the following keys: 323, 156, 731, 125, 73, 200 The size of the hash table is 11 The hash function, h(k)= k mod m Use Quadratic Probing to resolve any collision, with constants C₁ = 1 and C₂ = 2 First compute the hash values using h(k) function and construct a table of k and h(k) as shown below: k H(K) 323 156 731 125 73 200 Show sample computations for h(k) Now construct a Hash Table of size 11 and place the keys (k) properly. Must give proper explanations and show computational details for each collision.

Suppose you have a hash table of size N = 64, and you are using pseudo-random probing. The keys in your hash are 4-digit integers (0000 through 9999) and your hash function is h(k) = (the sum of the digits in k). Assume that the first 4 slots of your pseudo-random probing array contain: 5, 10, 60, 30 What are the first 4 values in the probe sequence (starting with the home position) for a record with key k=1948?

Write the lines of code to insert the key (book's ISBN) and value    ("book") pair into "my_hash_table".