Computer Science 115 - Algorithms and Data Structures
This repo is where I am currently keeping all of my assignments for CSci 115. This course is the second data structures and algorithms course that is taken by Computer Science students where more advanced subjects are covered in comparison to the prior course.
- Directed Graph implementations
- Undirected Graph implementations
- Solutions to Tower of Hanoi problem
- Sorting algorithm analysis
- Linked List custom memory management
- Dynamic memory management
- Binary Search Trees
- Union/Find implementation
- Huffman Coding Trees
- Associative arrays and hashing
- Polymorphism
- Min/Max Heap