Data Structures and Algorithms I
A core course in our middle-level computer science series, this class explores the powerful interplay between data structures and algorithms. Students will learn to implement, analyze, and select foundational data structures to design high-performance algorithms. The course emphasizes how these components work together to provide elegant and efficient solutions to complex computational challenges.
Lecturer
Date
22nd September ~ 15th December, 2025
Location
| Weekday | Time | Venue | Online | ID | Password |
|---|---|---|---|---|---|
| Monday | 13:30 - 16:55 | A14-201 | ZOOM 05 | 293 812 9202 | BIMSA |
Prerequisite
Discrete mathematics, Python programming
Syllabus
Basics of Algorithms
Array
HashMap
String
Stack
Queue
Recursion
Bitmask Programming
Binary Search
Greedy Algorithms
Dynamic Programming
Array
HashMap
String
Stack
Queue
Recursion
Bitmask Programming
Binary Search
Greedy Algorithms
Dynamic Programming
Reference
1. Introduction to The Design and Analysis of Algorithms, Anany Levitin.
2. Algorithms Illuminated, Tim Roughgarden.
3. Data Structures & Algorithms in Python, Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser.
2. Algorithms Illuminated, Tim Roughgarden.
3. Data Structures & Algorithms in Python, Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser.
Audience
Undergraduate
, Advanced Undergraduate
, Graduate
, Postdoc
, Researcher
Video Public
No
Notes Public
No
Language
Chinese