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

Q: You are to program an open addressing hash table. Use array size to be 50. Your hash table must…

A: Hashing is an improvement over Direct Access Table. The idea is to use a hash function that converts…

Q: this code: def insertSort(A):         for i in range(1,len(A)):         j = i-1         while…

A: Hypothisis happens when we make decision based on the data. In the above program we swap position…

Q: Suppose the following array were passed in to a mergesort algorithm: 42 39 87 21| 56 93 43 35 Draw…

A: I have applied the merge sort algorithm in the array and I have show how our array will be…

Q: Using Quicksort, if the Pivot is [28], which values are found to be in the wrong partition after the…

A: The given array is : [28, 17, 45, 51, 35, 14, 88, 24] We are choosing 28 as the pivot for running…

Q: Select an integer N where 12 < N < 60. Rehash the original hash table to the larger hash table array…

A: Given, Original array: 8 16 33 43 12 h(k)=k mod Tablesize g(k)=5-(k mod 5) Table size of…

Q: 1. Write a pseudocode function R1(key, a, b, A, B, N) that takes non-negative integers key, a and b…

A: function R1(key, a, b, A, B, N):hash = (a * key + b) mod Nif A[hash] == key and B[hash] ==…

Q: The pseudo-code to create the matrix: Procedure AdjacencyMatrix(N): //N represents the number of…

A: Given data : The pseudo-code to create the matrix: Procedure AdjacencyMatrix(N): //N represents the…

Q: Please convert to C language   //linear probing #include using namespace std; void…

A: memset() is used to fill a block of memory with a particular value. void *memset(void *ptr, int x,…

Q: Given the base address of an array a[30...40, 20...60] as B = 1040 and size of each element W= 2…

A: Note : As per Policy 1st question should answer it questions from different topics. Repost the…

Q: 1: Find the location in memory of: AR[5, 6, 5], if the base address B=200, the dimension of the…

A: I = Row Subset of an element whose address to be found = 5J = Column Subset of an element whose…

Q: int hashValue = Hash(data); int probeValue = (hashValue 1) % TableSize; if (array[probeValue] ==…

A: the solutions is an given below :

Q: Solution should in JS Write a function that divides an array into chunks of size n, where n is the…

A: As per the given question, we need to write a function named chunkify() that takes an array i.e arr…

Q: Question Give the level-order traversal of the BST that results after inserting the following…

A:

Q: Solve the following unsorted list: 9,36,4,69,24,16,91,2,45,13,7…

A: Sorting array elements or list is means that arranging the list of elements either ascending order…

Q: Solution should in JS Write a function that divides an array into chunks of size n, where n is the…

A: In this problem, we need to design the code in the Js programming language.  Input -  integers…

Q: Trace counting sort on the following list L of unordered keys which lie within the range [10, 18].…

A: Counting sort is a simple sorting algorithm that works by counting the number of occurrences of each…

Q: Q.17 Write the properties of hash functions.

A:

Q: Select true or false for the statements below. Explain your answers if you like to receive partial…

A: In an unsorted array it takes O(n) time to find the element we want to delete. Then in order to…

Q: #include const int TABLE_SIZE = 17; class HashMap { private: public: }; int { HashEntry *table;…

A: Algorithm: 1. Create a class named HashEntry with two private members: key and value. 2. Create a…

Q: please implement two functions the

A: The below is the code to implement doubly linked list without storing two addresses but instead…

Q: Write a complete C++ program that implements an open addressing Hash Table Let the size of the keys…

A: The C++ code is below:

Q: b) Consider an empty hash table of size 7. Draw the table that results after inserting, in the given…

A: The answer is as follows:-

Q: Consider the following BinaryTrie. Which nodes would have to change their jump pointers on add(0010)…

A: we need to find who will change their jump poiner.

Q: The purpose of this project is to assess your ability to: Implement a hash table Utilize a hash…

A: To implement a hash table and utilize it efficiently for data retrieval, we will follow these…

Q: Trace bucket sort for a list L[1:9] = {0.56, 0.87, 0.21, 0.43, 0.77, 0.62, 0.33, 0.28, 0.99} of…

A: The floating point integers in the list L[1:9] must be distributed across the ten buckets marked 1,…

Q: In the open addressing solution to the collision problem in the following hash table, the value 40…

A: Hashing is a searching technique. To search data in hashing the time taken is order of one. For…

Q: Implement a custom dictionary class in Python that supports collision resolution for hash…

A: In Python, dictionaries are implemented using hash tables, which are data structures that allow for…

Q: Trace counting sort on the following list L of unordered keys which lie within the range [10, 18].…

A: In this question we have to trace counting sort on the following list L of unordered keys which lie…

Q: 3) L is a data element linear list. Implement the list as follows: I a linear open addressed hash…

A: LinearHashTable Class:Initialize a class called LinearHashTable with a specified size for the hash…

Q: Given two arrays of integers, write a function to find the intersection of the arrays. The…

A: Algorithm: Intersection of Two Arrays using HashSetInput: Two integer arrays nums1 and nums21.…

Q: Solution should in JS Write a function that divides an array into chunks of size n, where n is the…

A: The Javascript code is given in the below step with code and output screenshot.

Q: 3. First, build a HCTree based on the frequency of chars in a file: a(3), b(5), c(4), d(26), e(12).…

A: Algorithm: Step1: Create a leaf node for each unique character and sort Step2: Select 2 nodes  with…

Q: Implement a merge sort algorithm have a mergesort function and a merge function Go off this code…

A: We have to Implement a merge sort algorithm that has a mergesort function and a merge function as…

Q: The purpose of this project is to assess your ability to (JAVA): Implement a hash table Utilize a…

A: In this Java implementation, the HashTable class represents the hash table, and the Node class…

Q: , j) ) to be partitioned is a(0..6). s already been moved to be the element a(6). ur of the…

A: Explained below

Q: Trace counting sort on the following list L of unordered keys which lie within the range [10, 18].…

A: In this question we have to trace counting sort on the following list L of unordered keys which lie…

Q: Exercise 3: Building a Point of Sales (POS) using a linked list data structure. In a POS system, a…

A: Building a Point of Sales (POS) linked list data structure: Class for POSNode: In Point of sales…

Q: Fill in the following traversals of the BST shown below: 50 20 11 58 44 54 70 2 18 39 Answers should…

A: In-order traversal The in-order traversal  follows the Left, Root, Right pattern to traverse the…

Q: Trace the execution of binary search for key=72  showing each complete pass on the following number…

A: Answer:Finding the position of binary tree key = 72:

Q: Trace counting sort on the following list L of unordered keys which lie within the range [10, 18].…

A: Counting sort is an efficient algorithm for sorting elements within a specific range. In this case,…