CS1332: Data Structures and Algorithms

This repository contains my personal coursework, notes, and assignments for GeorgiaTechX's CS1332: Data Science: Machine Learning professional certificate series.

---

Data Structures and Algorithms Certificate of Completion — 2025

---

Course Series Overview

This professional certificate series covers fundamental and advanced data structures, algorithmic design, and analysis techniques. Click any course to view it on edX:

1. Data Structures & Algorithms I: ArrayLists, LinkedLists, Stacks and Queues
   Covers Java fundamentals, linear data structures, ADTs, recursion, and amortized analysis.

2. Data Structures & Algorithms II: Binary Trees, Heaps, SkipLists and HashMaps
   Explores hierarchical and nonlinear structures like BSTs, heaps, HashMaps, and SkipLists.

3. Data Structures & Algorithms III: AVL and 2-4 Trees, Divide and Conquer Algorithms
   Delves into self-balancing trees (AVLs, 2-4 Trees) and iterative and divide & conquer sorting algorithms (Bubble, Cocktail Shaker, Selection, Merge, Quick, Radix Sort).

4. Data Structures & Algorithms IV: Pattern Matching, Dijkstra’s, MST, and Dynamic Programming Algorithms
   Focuses on pattern matching (Boyer-Moore, KMP, Rabin-Karp), graph algorithms (DFS, BFS, Dijkstra’s, MST), and dynamic programming.

---

Disclaimer:

These solutions are shared for educational purposes only. Do not copy, submit, or present any of this work as your own; doing so would violate edX's academic honesty policy.