CS 302 - Data Structures & Algorithms II Spring 2009 Lectures

---

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

---

Lecture 1: Introduction - C: An Imperative Language
Lecture 2: Input, Output, and Files
Lecture 3: Memory usage and deallocation or Word Version
Lecture 4: Linked Lists and Other Linear Data Structures
Lecture 5: Pointers
Lecture 6: GDB
Lecture 7: The Preprocessor
Lecture 8: Function Pointers
Lecture 9: The Profiler
Lecture 10: Shell Scripts and Linux Commands
Lecture 11: Gawk and other Linux Commands
Lecture 12: Random Access Files and Other Library Calls
Lecture 13: Introduction to Graphs
Lecture 14: Matrix Implemenentation and code
Lecture 15: List Implementation and code [ notes]
Lecture 16: Graph Generators
Lecture 17: Depth First Search
Lecture 18: Minimum Spanning Trees and code
Lecture 19: MST: Prim's Algorithm
Lecture 20: MST: Kruskal's and Boruvka's Algorithms
Lecture 21: Depth First Search Applications
Lecture 22: Hash Functions
Lecture 23: Collision Resolution and additional notes on Collsion Table
Review: Exam 2
Lecture 24: AVL Trees and code
Lecture 25: Red-Black Trees and code
Lecture 26: More on Red-BlackTrees