CS 302 - Data Structures & Algorithms II Spring 2008 Lectures

---

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

---

Lecture 1: Introduction - C: An Imperative Language
Lecture 2: Pointers
Lecture 3: Allocation and Deallocation
Lecture 5: Linked Lists and other Linear Data Structures
Lecture 6: The Preprocessor and Binary Files
Lecture 7: Function Pointers
Lecture 9: Shell Scripts and Linux Commands
Lecture 10: Hash Functions
Lecture 12: Introduction to Graphs
Lecture 13: Matrix Implemenentation
Lecture 14: List Implementation
Lecture 15: Graph Generators
Lecture 16: Non-trivial Graph Processing
Lecture 17: Depth First Search
Lecture 18: Depth First Search Applications
Lecture 20: Breath First Search
Lecture 21: Generalized Search and Analysis
Lecture 22: Minimum Spanning Trees
Lecture 23: MST: Prim's Algorithm
Lecture 24: MST: Kruskal's and Boruvka's Algorithms
Lecture 25: Digraphs
Lecture 26: Transitive Closure
Lecture 27: DAGs
Lecture 28: Shortest Paths