CS 302 - Data Structures & Algorithms II Spring 2005 Lectures

---

Loyola College > Department of Computer Science > CS 302 > Lecture Notes

---

Lecture 1: Introduction - Back in Time: C
Lecture 2: Continuation of Lecture 1: Introduction - Back in Time: C
Lecture 3: Introduction to Files
Lecture 4: Binary Files
Lecture 5: Pointers
Lecture 6: Modified Pointers
Lecture 7: Templates & Pointers
Lecture 8: Object Pointers & Hash Functions
Lecture 9: Resolving Collisions when Hashing
Lecture 10: Introduction to Graphs
Lecture 11: Graph ADT
Lecture 12: Graph ADT (Adjacency Matrix)
Lecture 13: Graph ADT (Adjacency Lists)
Lecture 14: Graph Generators
Lecture 15: Shell Scripts
Lecture 16: Working with Scripts
Lecture 17: Non-trivial Graph Algorithms
Lecture 18: Depth First Search
Lecture 19: DFS Applications
Lecture 20: DFS Applications and BFS
Lecture 21: Generalized Search and Graph Analysis
Lecture 22: Intro to MST
Lecture 23: Principles of MST
Lecture 24: MST algorithms
Lecture 25: MST algorithms and digraphs
Lecture 26: Digraphs and DFS
Lecture 27: Transitive Closure
Lecture 28: DAGs and Topolgical Sorting
Lecture 29: Shortest Paths
Lecture 30: Single-Source Shortest Paths
Lecture 31: Floyd's Algorithm