What is the time complexity of search function in a hash table using a doubly linked list? a) O(1) b) O(n) c) O(log n) d) O(n log n)

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 b c d e f g h i j k l 97 98 99 100 101 102 103 104 105 106 107 108 m n o p q r s t u v w x 109 110 111 112 113 114 115 116 117 118 119 120 y z                     121 122

Given a sequence of 5 keys < 53, 66, 32, 41, 88 > for searching task: a) Given the hash function H(k) = (3.k) mod 7, insert the keys above according to its original order (from left to right) into a hash table of 7 slots. Indicate the cases of collision. Clearly show the steps and calculation with a table. b) In case of any collisions found above in a) part, determine the new slot for each collided case using Linear Probing to solve the collision problem. Clearly show your answer for each identified case. No step of calculation required. o (Answer with “NO collision found”, in case there is no collisions found above) c) In case of any collisions found above in a) part, determine the new slot ONLY for the first collided case using Double-Hashing (with functions below) to solve the collision problem. Clearly show the steps of your calculation. d1 = H(k) = (3.k) mod 7 di = (di−1 + ((5·k) mod 6) + 1) mod 7 , i ≥ 2 o (Answer with “NO collision found”, in case there is no collisions…

Can m-size linked lists be stored in a hash table? Why do we need to use a hash function, exactly? Give us a sample.

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)

Implement a commonly used hash table in a program that handles collision using linear probing. Using (K mod 13) as the hash function, store the following elements in the table: {1, 5, 21, 26, 39, 14, 15, 16, 17, 18, 19, 20, 111, 145, 146}.

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is?a) log2 nb) n⁄2c) log2 n – 1d) n

the drop down bar is the selection you have to choose from for each answer

What is the time complexity of delete function in the hash table using a doubly linked list?a) O(1)b) O(n)c) O(log n)d) O(n log n)

How can a hash table improve efficiency over a linear list? Problem?