Unordered Data Structures

Description

Course 3 of 3 in the Accelerated Computer Science Fundamentals Certification on Coursera.

I'm using this repo to track my progress through the course.

Accelerated CS Fundamentals Certification - University of Illinois Urbana Champlain via Coursera

• Course 1: Object-Oriented Data Structures in C++
  • Link to my github repo for this course here
• Course 2: Ordered Data Structures
  • Link to my github repo for this course here
• Course 3 (this one): Unordered Data Structures
  • Link to my github repo for this course here

Link: Github repo for source files used in all 3 courses in the Accelerated CS Fundamentals Certification

---

Week 1: Orientation; Hashing

• Intro to Hashing
• Hash Function
• Collision Handling
  • Separate Chaining
  • Probing and Double Hashing
• Hashing Analysis

Week 2: Disjoint Sets

• Disjoint Sets
  • Intro
  • Naive Implementation
• Disjoint Set UpTrees:
  • A better Implementation
  • Simple running time
  • Smart union and path compression

Week 3: Graph Data Structures

• Graphs
  • Introduction
  • Vocabulary
  • List Implementation
  • Adjacency Matrix Implementation
  • Adjacency List Implementation

Week 4: Graph Traversal

• Graph Traversals
  • Breadth First Traversal (BFS)
  • Depth First Traversal (DFS)
• Minimum Spanning Trees
  • Minimum Spanning Trees (MST) Intro
  • Kruskal's Algorithm
  • Prim's Algorithm
• Shortest Path Algorithms
  • Dijkstra's Algorithm
    • edge cases
    • runtime
  • Landmark Path Problem

---

Certificate of Completion - 11-15-2019