Course homework assignments completed during CS 1332 at Georgia Institute of Technology.
This repository contains implementations of fundamental data structures and algorithms written in Java.
Homework01/
Homework02/
Homework03/
Homework04/
Homework05/
Homework06/
Homework07/
Homework08/
Homework09/
Homework10/
Each assignment targets a specific data structure or algorithm family, building toward a comprehensive understanding of the CS 1332 curriculum.
| Assignment | Topic |
|---|---|
| Homework 01 | ArrayList |
| Homework 02 | Doubly Linked List |
| Homework 03 | Array & Linked Deques |
| Homework 04 | Binary Search Tree |
| Homework 05 | Min Heap |
| Homework 06 | Quadratic Probing HashMap |
| Homework 07 | AVL Tree |
| Homework 08 | Sorting Algorithms |
| Homework 09 | Pattern Matching (KMP, Boyer-Moore, Rabin-Karp) |
| Homework 10 | Graph Algorithms (BFS, DFS, Dijkstra's, Prim's, Kruskal's) |
All implementations are my own original work, completed as part of the GT CS 1332 curriculum. Please do not reuse or redistribute this material for academic submissions.