Algorithms and Data Structures (CSC211) — Lecture Slides¶
Presentation-style slide decks for the CSC211 lectures, one slide per PDF page — use full-screen view in your PDF reader for a proper presentation, or print them for offline study.
- Lecture 1: Introduction to Data Structures
- Lecture 2: Classification, Operations, and ADTs
- Lecture 3: Algorithm Analysis and Complexity
- Lecture 4: Arrays and Sequential Storage
- Lecture 5: Linked Lists: Fundamentals
- Lecture 6: Singly Linked List Operations
- Lecture 7: Doubly Linked Lists
- Lecture 8: Circular Linked Lists
- Lecture 9: Linear Structures: Applications
- Lecture 10: Stack ADT and Implementation
- Lecture 11: Stack Applications: Expression Conversion
- Lecture 12: Recursion
- Lecture 13: Queue ADT and Implementation
- Lecture 14: Circular Queue, Deque, and Priority Queue
- Lecture 15: Queue Applications
- Lecture 16: Trees and General Trees
- Lecture 17: Binary Trees and Representation
- Lecture 18: Midterm Review
- Lecture 19: Binary Tree Traversals
- Lecture 20: BST: Search and Insertion
- Lecture 21: BST: Deletion and Analysis
- Lecture 22: AVL Trees
- Lecture 23: Heap and Priority Queue
- Lecture 24: Tree Applications
- Lecture 25: Graphs and Representation
- Lecture 26: Graph Traversal: BFS and DFS
- Lecture 27: Shortest Path: Dijkstra's Algorithm
- Lecture 28: Minimum Spanning Trees
- Lecture 29: Searching Algorithms
- Lecture 30: Sorting: Elementary Algorithms
- Lecture 31: Sorting: Efficient Algorithms
- Lecture 32: Hashing and Efficient Data Access