levo
Log inStart

Communication Networks and File Organisation

Overflow and file reorganisation

  • 3 things to know
  • A2 Unit 4

Overview

Overflow, in a hashed file, open or linear probing method of handling overflow and use of a separate overflow area.

What you need to know

Answer each one before you reveal it.

Your recallNot started
Key term

What is overflow, in a hashed file?

Key term

Describe the open or linear probing method of handling overflow.

Evaluation

Give one disadvantage of linear probing.

Questions from this subtopic

Each one with the model answer underneath.

  1. 1

    What is overflow, in a hashed file?

    Model answer

    A record that cannot be placed at its hashed address because that address is already occupied.

  2. 2

    Describe the open or linear probing method of handling overflow.

    Model answer

    The record is placed at the next free address after the one calculated, and a search follows the same sequence to find it again.

  3. 3

    Give one disadvantage of linear probing.

    Model answer

    Occupied addresses form clusters, so a collision anywhere in a cluster lengthens the search for every key in it.

  4. 4

    Describe the use of a separate overflow area.

    Model answer

    Colliding records are written to a reserved area, and the home address holds a pointer to the record placed there.

  5. 5

    Describe chaining.

    Model answer

    Each address heads a linked list, and every record hashing there is added to that list.

  6. 6

    Compare chaining with a separate overflow area.

    Model answer

    Both keep the home address findable, but chaining keeps each key's records together so a search follows only its own list, whereas a shared overflow area can require scanning records belonging to other addresses.

See the rest and revise

Other ways to work this

The same content, four other ways.

What is inside Levo

Six ways to work the same material.

1Closed book
2Open book
3Closed book

The 3-step method, run for you

Answer cold, learn it, then prove it stuck. Levo tracks the jump between your first attempt and your last.

Hardware: Architecture, Memory and Storage
Networks and Data Transmission
Logic Gates and Boolean Algebra
Data Representation and Data Types

Cram a whole paper in one sitting

Sort every topic into what you know and what you do not, then drill only the weak ones.

Fetch, , execute.
decodecompilestore

Blank Blitz makes facts automatic

Rapid timed gap-fills on the terms and numbers you need to recall without thinking.

AEncryption is reversible.
BThe stored form could be decrypted.
CA hash cannot be reversed.

Build It gets the exam shape right

Assemble a full-mark answer from its marking points, in the order an examiner wants them.

A bit is a single binary digit.
TrueFalse

Test It catches misconceptions

Spot the fault in a statement. The traps are the mistakes students actually make.

721941163128510

Brain Breaks between sessions

Short focus games to reset attention, so the next set lands better than the last.

Every question in Communication Networks and File Organisation, on a schedule.

Attempt a question from memory, write the correct version, then attempt it again. Levo records the jump between your first attempt and your last, and brings each question back on the day you are due to forget it.

Start revising, £5 a monthSee how the method works

Or £46 a year, about £3.83 a month. Cancel anytime.