Java Projects
Binary Search Tree
I was tasked with writing certain methods for the Binary Search Tree:
size(), height(), contains(), find(), add(), and remove().
Project Details
- Recursion
- Binary Search Trees
- Conditionals, iteration
Deque
I was provided an abstraction of a student object and was tasked to implement a dequeue
using a circular array. I was provided a JUnit test suite.
Project Details
- Queues, Dequeues
- Circular Array
- Mod function
Hashing
I was provided a project template containing book ISBN numbers. The project was to implement three hashing methods - open hashing, closed hashing with linear probing, and quadratic residue search.
Project Details
- Hashing
- Linear probing (Built into Java)
- Open Hashing
- Quadratic Residue Search