Good program comes from appropriately using the resources on the computer. There are two types of key resources: computational units (CPU, FPU, etc.) and storage units (memory, disk, etc., along with channels and networks). Data Structures and Algorithms discuss how to use those two types of resources suitably and effectively. Traditionally, data structures aim at the use of storage units, while algorithms aim at the use of computational units. But the two aims are actually inseparable: succinct data structures require coupling with corresponding algorithms; efficient algorithms require coupling with corresponding data structures. The course, designed as a required course for NTU CSIE students in the freshman year, introduces basic data structures and their corresponding algorithms. We will move from the concrete side of implementing basic data structures to the abstract side of analyzing the complexity of storage and computation.

The goal of this course is to develop a fundamental understanding of how to design programs that use computational and storage resources effectively. Students will learn core data structures and their corresponding algorithms, with emphasis on the inseparable relationship between data organization and algorithmic efficiency. Through hands-on implementation and systematic analysis, the course guides students from concrete programming practices to abstract reasoning about time and space complexity. As a required freshman-level course for NTU CSIE students, it aims to build a solid foundation for efficient problem solving and for advanced study in computer science.

familiarity with C programming

12 to 24 hours

Introduction to Algorithms, 4rd edition by Cormen et al., 2022

Introduction to Algorithms, 4rd edition by Cormen et al., 2022