Problem Statement Bitcoin mining involves finding a SHA-256 hash of recent Bitcoin transactions with a certain number of leading zeroes (currently 17). A hash function takes in a string, and outputs another string, which it derives by extracting unique features of the input. In this lab the goal is to compute a hash of a set of input strings, and identify the two strings with the "closest" hashes, defined as the number of hexadecimal digits their SHA- 256 hashes share in common. Of this pair, print out the one which came earliest in the input list. If there are several competing pairs with the same quantity of shared hexadecimal digits, then just print out the string in that group which came earliest in the input list. Input Format The first line contains N(number of words) followed by Nlines. Each line contains a string. Output Format Print out the input string matching the above criteria.

Problem Statement Bitcoin mining involves finding a SHA-256 hash of recent Bitcoin transactions with a certain number of leading zeroes (currently 17). A hash function takes in a string, and outputs another string, which it derives by extracting unique features of the input. In this lab the goal is to compute a hash of a set of input strings, and identify the two strings with the "closest" hashes, defined as the number of hexadecimal digits their SHA- 256 hashes share in common. Of this pair, print out the one which came earliest in the input list. If there are several competing pairs with the same quantity of shared hexadecimal digits, then just print out the string in that group which came earliest in the input list. Input Format The first line contains N(number of words) followed by Nlines. Each line contains a string. Output Format Print out the input string matching the above criteria.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter18: Deterministic Dynamic Programming

Section18.4: Resource-allocation Problems

Problem 3P

See similar textbooks

Similar questions

4 The Java hash function for Strings computes a hash code based on afixed maximum number of characters of the string. Given that Strings haveno meaningful upper bound in length, describe how an effective, constant-timehashing algorithm can be constructed. (Hint: If you were to pick, say, eightcharacters to represent a string of length l, which would you choose?)
code in python attached please Define a hash table with an associated hash function ℎ(?)h(k) mapping keys ?k to their associated hash value. b) In simple uniform hashing, each key is assumed to have equal probability to map to any of the hashes in a given table of size m. Given an open-address table of size 500500 and 22 random keys, what is the probability that they hash to the same value? What is the probability that they hash to different values?
Hash table is a data structure in which keys are mapped to array positions by a hash function. Theprocess of mapping the keys to appropriate locations in a hash table is called hashing. Hash functions areused to reduce the number of collisions.i. Mention the methods to minimize collision.ii. Explain the advantage of using double hashing over linear and quadratic probing techniques.iii. Load the keys given below in a hash table of size 7 in the same order using chaining with thehash function h(key)= key % 7. Show graphically how collisions are resolved using chainingin this particular case.12, 101, 3, 21, 14, 13, 16, 7, 141
Consider a open bucket hash table and closed bucket hash table in which the keys are student identifiers (strings of 6 digits). Assume the following number of buckets and hash function: m = 100; hash(id) = first two digits of id #. Starting with an empty hash table, show the effect of successively adding the following student identifiers: 000014, 990021, 990019, 970036, 000015, 970012, 970023. Use following function as second hash function hash(id) = last digit of id # Show the effect of deleting 000014 from the hash table. (Java Programming DSA)
python In simple uniform hashing, each key is assumed to have equal probability to map to any ofthe hashes in a given table of size m. Given an open-address table of size 100 and 2random keys, what is the probability that they hash to the same value? What is theprobability that they hash to different values?
Consider a hash table (hash function and hashing scheme) and its maincharacteristics.Which of the following is FALSE ?O A hash function's output is deterministic.O Linear Probe Hashing is the most basic hash function.O A hash table provides on average O(1) operation complexity.O A hashing scheme handles key collisions after hashing.
Computer Science (a) Let h be a collision resistant hash function. Now consider the following function H that is defined for binary strings of even length. Let x = x1||x2 with x1 ∈ F2n and x2 ∈ Fn2 . Then H(x) = h(x1 ⊕ x2). Prove that this function is not collision resistant.
java program : Given the following input keys: 20, 30, 2, 35, 25, 24, 32, 42 and Hash function h(X) = X mod 11, HTSize = 11. Obtain the resulting hash table when open addressing with linear probing is used to resolve collisions. Show the values of hash function for all keys and the hash table.
Consider a OBHTin which the keys are student identifiers (strings of 6 digits). Assume the following number of buckets and hash function: m = 100; hash(id) = first two digits of id Starting with an empty hash table, show the effect of successively adding the following student identifiers: 000014, 990021, 990019, 970036, 000015, 970012, 970023. Use following function as second hash function hash(id) = last digit of id 2. Show the effect of deleting 000014 from the hash table
In Python, implement a hashing table data structure of size 20, which can cope with collisions. Thus, you must implement the closed collision system in its three modes: Linear scanQuadratic scanDouble hashing scan. For halt use halt(k)= (k mod (m - 1)) + 1, where m is the size of the table. The data to be managed are students from a certain university who have a 5-digit registration number and it is unique. In addition, the student has a name, age and address. Create a .txt file with 10 students (one for each line) and have them loaded into your program. Build a menu of options where you can: - Enter a new student. For this option, that only allows entering the 5-digit license plate and that random data is automatically generated for the name, age and address. Return the position where it was entered and if it is not possible to enter it, print a message that explains why the entry was not obtained.
Consider a CBHT (closed bucket hash table) in which the keys are student identifiers. Assume that the number of buckets m = 100 and hash function hash (id) = first two digits of id. #Starting with an empty hash table, show the effect of successively adding the following student identifiers: 000014, 990021, 990019, 970036, 000015, 970012, and 970023. Show the effect of deleting 000014 from the hash table.
L is a list of data items that is linear. Implement the list as: I an ordered list; (ii) a linear open addressed hash table using a suitable hash function of your choosing.Use binary search or hashing to find a collection of keys on representations I and ii), respectively. Compare how well the two approaches performed over list L.