Computer Science D Question 9 What is the probability of having a 64-bit hash value with the following format: 00000X-X, where X is zero or one? Op 2^5/ 2459 Op- 264 /2S Op- 2*64 /259 Op• 259/264 Question 10 Assuming that the "Enc" function of RSA algorithm is as follows: C-M^e (mod N) Where "C" is the cipher, "M" is the message and "e" is the public key. If the cipher is "2081", the public key is "13", and N is 2537-43'59, what would be the message Mand private key "d"? OM-1819 and d-937 OM-1820 and d-931 OM-1415 and d- 941 OM= 2182 and d= 997

Computer Science D Question 9 What is the probability of having a 64-bit hash value with the following format: 00000X-X, where X is zero or one? Op 2^5/ 2459 Op- 264 /2S Op- 2*64 /259 Op• 259/264 Question 10 Assuming that the "Enc" function of RSA algorithm is as follows: C-M^e (mod N) Where "C" is the cipher, "M" is the message and "e" is the public key. If the cipher is "2081", the public key is "13", and N is 2537-43'59, what would be the message Mand private key "d"? OM-1819 and d-937 OM-1820 and d-931 OM-1415 and d- 941 OM= 2182 and d= 997

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

1. An open hashing scheme requires the use of random access ( true /false ). 2. A good hashing function should ___ distribute the records amongthe buckets. 3. For an open hashing scheme with 100 buckets and 4000 records,the average number of record reads to locate a record is equal to___.
3. For this task you are going to generate a key and use stream cipher. (a) Use the quadratic residue pseudorandom generator (BBS)on the prime numbers p and q of your choice, where 5000 < p, q < 9000, to generate the first five bits of your key k0, k1, k2, k3 and k4. (b) Generate a key sequence of length 40 by using the recurrence relation xn+5 = xn+4 + xn+2 + xn+1 + xn (mod 2), n ≥ 0 where the initial values are the key generated in (a). (c) Encode your last name by using the ASCII code. Use the stream cipher and the key you generated above to encrypt your last name.
Given the keys k1, k2, k3, k4, k5 sorted in ascending order alphabetically, with respective searchfrequencies of 0.30, 0.04, 0.01, 0.45, 0.20, construct the optimum binary search tree and writedown its cost.
Computer science question
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…
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)
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?
c++
In §12.2 Lamport's Hash we mentioned the notion of using only 64 bits of the hash. At each stage, 128 bits are computed, 64 bits are thrown away, and the hash of the retained 64 bits is used in the next stage. The purpose of only using 64 bits is so that a human does not need to type as long a string. Assuming the person will still only type 64 bits, does it work if hashn does a hash of all 128 bits of hashn-1, but what the person actually transmits is 64 bits of the result?
Consider the following two functions written in pseudocode: functionA() print "what is your age?" return the input value functionB(int age) look up life expectancy for a person who is age years old in a hash table return the life expectancy Which function has referential transparency? O neither O functionB O functionA O both
1. The performance of hash table O A Related to the method of handling conflicts, not the length of the table O B It has nothing to do with the method of handling conflicts, but with the length of the table OC It is related to the conflict handling method and table length OD It has nothing to do with conflict handling methods and table length 2 When using binary search, the linear list must be A Store in Sequential List B Store in linked List OC Store in Sequential List, and the list is ordered by keywords OD Store in linked List, and the list is ordered by keywords
Strings of undefined length are used as keys to access a hash table. Report the C implementation of a proper hash function. Specify and explain (in plain English) how to select the algorithm and how to avoid overflows during the computation of the hash function. Motivate all choices.