The course designers and instructors deeply appreciate researchers in the
community for their inspiring works, which provide rich materials for developing
the course and advancing the research in this direction.
Back to Homepage · Previous Page
Fig 1. The textbook.
This course is a cornerstone of computer science, providing the essential foundation for writing efficient and scalable software. It focuses on organizing, storing, and processing data in ways that optimize performance and resource usage. The course begins by introducing fundamental concepts. From there, it explores core data structures, including arrays, linked lists, stacks, and queues, before progressing to more advanced topics like trees, graphs, and hash tables. Alongside these structures, students learn key algorithms for searching, sorting, recursion, dynamic programming, and graph traversal. By combining theoretical principles with hands-on implementation, the course equips learners with the problem-solving skills needed to tackle real-world computational challenges.
Mastery of data structures and related algorithms is crucial for software development, competitive programming, and technical interviews, making this course indispensable for aspiring programmers and computer scientists.
Prerequisites: Before registering for this course, a student must check if he has basic knowledge of the C/C++ programming language.
Lectures
The course slides are provided in the table below. If you have any questions
or suggestions, please feel free to reach out to the instructor or teaching
assistants. The course designers sincerely thank the instructors and researchers
in the community whose inspiring work has contributed valuable material for
these slides.
|
|
Lectures | Materials |
|---|---|---|
|
|
Introduction | Slides-1 |
|
|
Linear List | Slides-2 |
|
|
Stack and Queue | Slides-3 |
|
|
String | Slides-4 |
|
|
Array and Generalized List | Slides-5 |
|
|
Tree | Slides-6 |
|
|
Graph | Slides-7 |
|
|
Dynamic Storage Management | Slides-8 |
|
|
Hashing | Slides-9 |
|
|
Internal Sorting | Slides-10 |
|
|
External Sorting | Slides-11 |
|
|
File System | Slides-12 |
Grading Scheme
Attendance (10%)
Labs (30%) – Online OJ
Mid-Term Exam (20%)
Final Exam (40%)
Teaching Assistants
Bing Shui (bingshui@smail.nju.edu.cn)
Online Discussion
QQ Group: 962664941
Office Hours
By appointment. Feel free to email TAs or the instructors to claim a time slot.
