Skip to main content
Princeton Mobile homeCourses home

Data Structures and Graph Algorithms

COS 528

Info tab content
Advanced topics in data structures and algorithms for graph and network problems. The intent of the course is to examine the most efficient algorithms known for a variety of combinatorial problems and to discover the principles underlying the design and analysis of these algorithms. The emphasis is on asymptotic worst-case and amortized analysis. We discuss both sequential and concurrent data structures and algorithms.
Instructors tab content
Sections tab content

Section S01

  • Type: Seminar
  • Section: S01
  • Status: O
  • Enrollment: 7
  • Capacity: 35
  • Class Number: 21684
  • Schedule: MW 01:30 PM-02:50 PM