Programming Language Pragmatics, 4th Edition 13.3Imagine you are writing the code to manage a hash table that will be shared amongseveral concurrent threads. Assume that operations on the table need to be atomic.You could use a single mutual exclusion lock to protect the entire table, or youcould devise a scheme with one lock per hash-table bucket. Which approach islikely to work better, under what circumstances? Why?

Answer) We are writing a code for mutual exclusion for a hash table which will be shared among…

Answered: Imagine you are writing the code to…

Engineering

Computer Science

Imagine you are writing the code to manage a hash table

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

3. Implement mutual exclusion with multithreading in Java Build a Java program which simulates a communication between a server and clients. You must use a thread to represent each party (as server or client). (Hint: study about the Semaphore class to perform mutual exclusion between threads) Create three threads. One thread will act as a server, which always ready to receive a message from a client (ping) and then replies the message to the same client (pong). The other two threads will become the clients, where each client will send a message to the server (ping) and waits for the reply (pong). Define 2 different classes to represent the server and the client. To perform the communication, each thread will refer to a same variable/data structure for sending and receiving the message. Use mutual exclusion approach to ensure each client can send and receive the reply without interruption from any other client(s). For this simulation, your objective is to ensure that each client must…
You can use URLs to access information on the Web from within Java programmes. (uniform resource locators). MindSlave software programmers (working on their new NetPotato browser) want to maintain track of a potentially enormous bookmark list of frequently visited URLs. It would be ideal if they could have arbitrary access to the values saved in the list. Is a List a suitable data structure? (Tip: If not, why not?)
Write a C program that implements a hash table with chaining for collision resolution. The program should allow the user to add, search, and delete elements from the hash table. When a collision occurs, the program should use a linked list to store multiple elements with the same hash value. The program should also keep track of the number of collisions and provide a way to display the entire hash table.
3. Cuckoo hashing. Consider a cuckoo hash table for six items, with two tables of size 5 (similar to what we have in the textbook example). Use the following hash functions to insert items in the order of U, V, W, X, Y, Z. Be sure to include some steps so that the instructor can trace your work.
IN C++ Perform a comparative analysis that studies the collision rates for various hash codes for character strings, such as various polynomial hash codes for different values of the parameter a. Use a hash table to determine collisions, but only count collisions where different strings map to the same hash code (not if they map to the same location in this hash table). Test these hash codes on text ﬁles found on the Internet. Use 37, 40, and 41 for parameter a. IN C++
Implement the producer consumer problem (also known as bounded buffer problem) in java. create two threads i.e. the producer thread and the consumer thread. Create a shared buffer object using a LinkedList or Queue. The producer adds data to the buffer and the consumer removes data from the buffer. The producer cannot add data if the buffer is full and the consumer cannot remove data from the buffer if it is empty. Make sure there are no race conditions and deadlocks.
Create a newconcrete class that implements MyMap using open addressing with double hashing.For simplicity, use f(key) = key % size as the hash function, where sizeis the hash-table size. Initially, the hash-table size is 6. The table size is doubledwhenever the load factor exceeds the threshold (0.5).
Need Java Language solution asap Roni and Rajesh love to play a rope-based game. The game is as follows. At first, Tracy writes a long random thread on a white board. Then, each player starting with Roni takes turns. Each time, the player has to clear the corresponding subtitle in the dictionary. The dictionary contains N words. Indeed, a player who can clear any small bullet unit in his time loses a game, and another player is declared the winner. Note that after deleting a small R-string, the remaining small series is separated, i.e., they cannot erase the word that appears partially to the left of R and slightly to the right of R. Decide who wins the game, assuming both players play very well Input 1 bar 1 foo Output Tracy
You can use URLs to access information on the Web from Java programmes. (uniform resource locators). Programmers at MindSlave Software would like to manage a potentially sizable bookmark list of frequently visited URLs for their new NetPotato browser. They would find it most helpful if they had unrestricted access to the list's preserved values. Is a List the right kind of data structure? If not, why not? (Hint:
Question :) #. Consider a hash table of size 7 with hash function hash(k) = k mod 7. Draw both hash tables (Closed-Bucket and Open-Bucket) that results after inserting, in the given order, the following values: 19, 26, 13, 48, 17, 49, 29, 55, 61, 14, 66. (Java Programming DSA).
Suppose you have an object made up of two w-bit integers, x and y. Show why x+y does not make a good hash code for your object. Give an example of a large set of objects that would all have the same hash code. c++ and provide good comments.
Consider a hash table of capacity 5 that uses open addressing with linear probing. This hash table uses a hash function that takes the remainder when the hash code of a string is divided by the capacity of the hash table. (For example, "air" hashes 0.) The hashCode method has been overridden for strings, which simply returns 0 if a string begins with 'a', 1 if it begins with 'b', etc. /** Returns 0 if a String begins with 'a', 1 if it begins with 'b', etc. */ public int hashCode() { return this.charAt(0) - 'a'; } Assume that "apple", and "butter" have been inserted in this order into the hash table. "fig" is to be inserted into the hash table. (a) Which array slot/index should "fig" be placed? Answer: (b) What is the load factor after "fig" is inserted into the hash table? Answer: