7. You have a hash function that takes the binary bits of a number, divides it...

7. You have a hash function that takes the binary bits of a number, divides it up into blocks of 4 bits and then XORs the blocks together. So for example, if we have 4 blocks, block X0, X1, X2 and X3, the result of the 4-bit block hash would be X0 XOR X1 XOR X2 XOR X3. For example, the hash of "011011001010" would be "0110" XOR "1100" XOR "1010". Demonstrate that this is a poor hash function by showing me a hash collision using this function and two different input strings of at least 8 bits.

Expert Solution

please don't forget to like.

venereology answered 1 hour ago

3. Draw the hash table that results using the hash function: h(k)=kmod 7 to hash the...

3. Draw the hash table that results using the hash function: h(k)=kmod 7 to hash the keys 50, 700, 76, 85, 92, 73, 101. Assuming collisions are handled by Quadratic probing. Don't write a program. Just please manually solve the problem. Thanks.

Write a function num_day that takes a number in the range of 1 through 7 as...

Write a function num_day that takes a number in the range of 1 through 7 as a parameter and returns a string representing the corresponding day of the week, where 1=Monday, 2 =Tuesday, 3=Wednesday, 4 = Thursday, 5 = Friday, 6 = Saturday, and 7 = Sunday. The function should return the string "Error" if the parameter is that is outside the range of 1 through 7. You may assume that the parameter will be only numbers. Save the function...

You are studying a microbial species that divides by binary fission. Which of these do you...

You are studying a microbial species that divides by binary fission. Which of these do you expect to happen in the culture as is grows in a laboratory setting? Check all that apply. -you expect the size of each cell to greatly increase over time, rather than the number of cells increasing much -you expect the total biomass (weight) of cells to increase over time -you expect the biomass to stay the same -you expect the number of cells in...

1a. What is the largest positive and negative number that you could represent with 7 bits...

1a. What is the largest positive and negative number that you could represent with 7 bits using signed magnitude? Show your work. 1c. Solve the following decimal notation equation using 8-bit binary numbers and 2’s complement notation: 69 - 7 = Show your work

1a. What is the largest negative number that you could represent with 7 bits using signed...

1a. What is the largest negative number that you could represent with 7 bits using signed magnitude? Show your work. 1b. What is the largest positive number that you could represent with 7 bits using 2’s complement? Show your work. 1c. Add the following two binary numbers 10110111 + 1011 = :Show your work. 1d. Solve the following decimal notation equation using 8-bit binary numbers and 2’s complement notation: 69 - 7 = :Show your work

3. Assume a hash table with 7 locations and the hashing function h(i) = i%7. Show...

3. Assume a hash table with 7 locations and the hashing function h(i) = i%7. Show the hash table that results when the integers are inserted in the order given. (10 points each. Total 30) • 5, 11, 18, 23, 28, 13, 25, with collisions resolved using linear probing • 5, 11, 18, 23, 28, 13, 25, with collisions resolved using quadratic probing • 5, 11, 18, 23, 28, 13, 25, with collisions resolved using chaining.

Using the simple model for representing binary floating point numbers A floating-point number is 14 bits...

Using the simple model for representing binary floating point numbers A floating-point number is 14 bits in length. The exponent field is 5 bits. The significand field is 8 bits. The bias is 15 Represent -32.5010 in the simple model.

Write a function that takes a binary search tree as input and produces a linked list...

Write a function that takes a binary search tree as input and produces a linked list of the entries, with the entries sorted (smallest entries at the front of the list and largest entries at the back). *Hint: use in-order traversal.* C++ there is no any structure

Write a program in C that takes as input an 8-bit binary number and prints the...

Write a program in C that takes as input an 8-bit binary number and prints the next 10 binary numbers. Define a binary number as int binNum[8]; Use binNum[0] to store the most significant (i.e., leftmost) bit and binNum[7] to store the least significant bit. Ask the user to input the first binary number with each bit separated by at least one space.

PYTHON: Write a function insertInOrder that takes in a list and a number. This function should...

PYTHON: Write a function insertInOrder that takes in a list and a number. This function should assume that the list is already in ascending order. The function should insert the number into the correct position of the list so that the list stays in ascending order. It should modify the list, not build a new list. It does not need to return the list, because it is modifying it. Hint: Use a whlie loop and list methods lst = [1,3,5,7]...

Question