Explain rehashing to handle collision, Operating System

Assignment Help:

Explain Rehashing to Handle Collision

Rehashing: Re-hashing schemes make use of a second hashing operation while there is a collision. If there is an additional collision, we re-hash till an empty "slot" in the table is found. The re-hashing function can either be a new function or a re-application of the original one. So long as the functions are applied to a key in similar order, then a sought key can all time be located.

2460_Explain rehashing to handle collision.png

Related Discussions:- Explain rehashing to handle collision

Android application development using java, This is a group project as desc...

This is a group project as described in the 'AssignmentDescription.pdf' file. I am doing a sub project which is "sub project Mobile application. Android or Apple based. Turn based

Define overflow chaining, Define Overflow Chaining Another method will ...

Define Overflow Chaining Another method will divide the pre-allocated table into two sections: the primary area to determine which keys are mapped and an area for collisions, g

#network OS, what are the design issues of network OS

what are the design issues of network OS

Directory structure, Write about directory structure?

Write about directory structure?

Explain the spawnvp function used in the netware, Explain the Spawnvp Funct...

Explain the Spawnvp Function used in the netware Spawnvp(flags, execNmae, argv) This function executes similarly to spawnlp( ) except that parameters are passed as a v

Explain general graph directory, General graph directory The serious pr...

General graph directory The serious problem with using an acyclic-graph structure is ensuring that there are no cycles. When we insert links to an existing tree-structured dire

Operating systems concepts, The code should be nicely formatted with plenty...

The code should be nicely formatted with plenty of comments. It should be easy to read, properly The summary section should include three parts: (1) Record the running t

System protection, what is the need-to-know principle? why is it important ...

what is the need-to-know principle? why is it important for a protection system to adhere to this principle?

Write a note on deadlocks, Write a note on deadlocks. The proper defini...

Write a note on deadlocks. The proper definition of deadlock A set of processes is deadlocked if every process in the set is waiting for an event that only a proces

Define seek time and latency time, Define seek time and latency time. T...

Define seek time and latency time. The time taken by the head to move to the appropriate cylinder or track is known as seek time. Once the head is at right track, it must wait

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages