Data Structures

• Fundamentals of Data Structures in C, 2nd Edition. Ellis Horowitz, Sartaj Sahni, and Susan Anderson-Freed. Silicon Press Press. 2007.

• Assignments and Projects (36%)
• Midterm Examination (32%)
• Final Exaimination (32%)

1. Basic Concepts
   • Overview [slides], [homework 01]
   • Performance Analysis [slides]
2. Arrays and Structures
   • Structures and Unions [slides]
   • Polynomial Abstract Data Type [slides]
   • Sparse Matrix Abstract Data Type [slides]
   • Matrix Transpose and Multiplication [slides]
   • Multidimensional Array Representation [slides]
3. Stacks and Queues
   • Stacks [slides], [homework 02]
   • Queues [slides]
   • A Mazing Problem [slides]
   • Evaluation of Expressions [slides]
4. Linked Lists
   • Singly Linked List [slides]
   • Polynomial Representation [slides]
   • Equivalence Relations, Sparse Matrices and Doubly Linked Lists [slides]
5. Trees
   • Trees, Binary Trees and Representations [slides]
   • Tree Traversals [slides]
   • Threaded Binary Trees [slides]
   • Heaps [slides], [homework 03]
   • Binary Search Trees and Forests [slides]
   • Disjoint Sets Representation [slides]
   • Counting Binary Trees [slides]
6. Graphs
   • The Graph Abstract Data Type [slides]
   • Depth-First Search and Breadth-First Search [slides]
   • Connected Components and Biconnected Components [slides]
   • Minimum Cost Spanning Trees [slides]
   • Shortest Paths [slides], [homework 04]
   • All Pairs Shortest Paths [slides]

© 2024 Joseph Chuang-Chieh Lin