Define linear probing with respect to hashing technique, Computer Engineering

Assignment Help:

Define Linear Probing

Linear Probing:  The easiest way to resolve a collision is to begin with the hash address and do a sequential search by the table for an empty location. The idea is to place the record in the next available position in the array. This method is known as linear probing. An empty record is indicated by a special value known as null. The array should be considered circular, so that when the last location is reached the search proceeds to the first record of the array. An unoccupied record location is forever found using this method if at least one is available; or else, the search halts unsuccessfully after scanning all locations. The main drawback of the linear probe method is that of clustering.

 


Related Discussions:- Define linear probing with respect to hashing technique

C++, Byteland county is very famous for luminous jewels. Luminous jewels ar...

Byteland county is very famous for luminous jewels. Luminous jewels are used in making beautiful necklaces. A necklace consists of various luminous jewels of particular colour. Nec

Basic software, Basic Software: The basic software is also referred to...

Basic Software: The basic software is also referred to as utilities. Basic software packages are available for performing operations such as data entry and validation, sorting

Explain folded network, Explain Folded network. Folded network: While...

Explain Folded network. Folded network: While all the inlets/outlets are connected to the subscriber lines, the logical connection shows as demonstrated in figure. When, the

How much duration is required for an off-hook signal, An off-hook signal wi...

An off-hook signal will repeat for a/an                   duration. For a/an finite duration, an off-hook signal will repeat.

What is busy hour traffic, Busy hour traffic is the (A)  maximum avera...

Busy hour traffic is the (A)  maximum average simultaneous traffic. (B)  traffic during peak hour. (C)  traffic when all subscribers are engaged. (D)  the durat

What are called stalls, What are called stalls? An alternative represen...

What are called stalls? An alternative representation of the operation of a pipeline in the case of a cache miss gives the function performed by every pipeline stage in each cl

Write miss policy - cache memories, WRITE MISS POLICY:   Write allo...

WRITE MISS POLICY:   Write allocate   fetch on write   fetch entire block, then write word into block   allocate a new block on each writ   allocate block, but

What is stack addressing, Q. What is Stack Addressing? In this addressi...

Q. What is Stack Addressing? In this addressing technique operand is implied as top of stack. It isn't explicit however implied. It employs a CPU Register known as Stack Pointe

Define register file, Define register file. All general purpose registe...

Define register file. All general purpose registers are combined into a one block called the register file.

Process of breadth first search, Process of Breadth first search: It's...

Process of Breadth first search: It's very useful to think of this search as the evolution of the given tree, and how each string of letters of word is found via the search in

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd