Student Hash Table Performance Analysis

A Java application comparing the performance of three map implementations:

• Linear Probing Hash Map
• Separate Chaining Hash Map
• Unsorted Table Map

The project measures insertion, search, deletion, collision count and load factor using a student enrolment dataset across multiple dataset sizes.

---

Features

• Custom hash table implementations
• Linear Probing
• Separate Chaining
• Unsorted Map baseline
• CSV dataset loading
• Performance benchmarking
• Collision analysis
• Load factor comparison

---

Tech Stack

• Java
• Object-Oriented Programming
• Hash Tables
• CSV Parsing

---

Project Structure

src/
├── analysis/
├── experiment/
├── map/
├── model/
├── util/
└── Main.java

---

Getting Started

Clone the repository

git clone https://github.com/varundutia/StudentHashTableAnalysis.git

Compile

javac -d out $(find src -name "*.java")

Run

java -cp out Main

---

Concepts Demonstrated

• Hash Tables
• Collision Resolution
• Linear Probing
• Separate Chaining
• Performance Analysis
• Algorithm Comparison

---

Future Improvements

• JUnit Tests
• Maven Support
• GitHub Actions
• Result Visualisations
• Additional Hashing Strategies

---

Author

Varun Dutia

GitHub: https://github.com/varundutia