Hashing

-
Like HashMap, Hashtable stores key/value pairs in a hash table. When using aHashtable, you specify an object that is used as a key, and the value that you want linked to that key. The key is then hashed, and the resulting hash code is used as the index at which the value is stored within the table.
Program to implement Hashtable
Developer: Abhishek Nandakumar
Licence: OpenSource
Platform/Language: Java
Download

Popular posts from this blog

Two Level File Directory

-
In the two level directory structures, each user has her own user file directory (UFD). When a user job starts or a user logs in, the system’s master file directory (MFD) is searched. The MFD is indexed by user name or account number, and each entry points to the UFD for that user.  When a user refers to a particular file, only his own UFD is searched. Developer:  Anirudh TP Licence:  OpenSource Platform/Language: C Download
Read more

Banker's Algorithm

-
T he banker’s algorithm is a resource allocation and deadlock avoidance algorithm that tests for safety by simulating the allocation for predetermined maximum possible amounts of all resources, then makes an “s-state” check to test for possible activities, before deciding whether allocation should be allowed to continue. Developer:  Anirudh TP Licence:  OpenSource Platform/Language:  C   Download
Read more