Data structures play a central role in computer science and are the cornerstones of efficient algorithms. Knowledge in this area has been at the kernel of related curriculums. This course aims at exploring the principles and methods in the design and implementation of various data structures and providing students with main tools and skills for algorithm design and performance analysis. Topics covered by this course range from fundamental data structures to recent research results. "Data Structures and Algorithm Design Part I" is an introductory course focusing on basic data structures, including vectors, lists, stacks, queues, binary trees, and graphs. They are important in programming practice, as well as fundamental to our advanced course: "Part II."
Data structures are a key component of computer science and a necessary foundation for building efficient algorithms. The knowledge it covers has always been at the core of the curriculum system of related majors. This course aims to focus on the design and implementation of various data structures and reveal the regular principles and methods and techniques; at the same time, it aims to enable students to understand and master the main routines and techniques for algorithm design and performance analysis. The topics taught range from basic data structures to recent research results. This semester's Data Structure (Part 1) is an introductory course on data structures, focusing on basic data structures such as vectors, lists, stacks, queues, binary trees, graphs, etc. Structure (Part 2)" provides the basis. For more detailed introduction, please see: http://dsa.cs.tsinghua.edu.cn/~deng/ds/mooc/, or check the FAQ column after joining this course.
