ECE2810J
Data Structures and Algorithms. This is the core course for Computer Science.
Basic Info
- Professor: Prof. Yutong Ban
- Semester: 2023 FA
- TAs: Kezhi Li, Chongye Yang, Kunyi Yang, Yaohui Chen
Materials
- 4 regular Recitation Class (RC) + 2 big RC
| Topics | Credit To | |
|---|---|---|
| Asymptotic Analysis, Comparison Sort | RC1 | Kezhi |
| Non-comparison Sort, Linear Time Selection, Hashing Table | RC2 | Yaohui |
| Mid Review | Part1, Part2, Part3 | TA Group |
| K-D Tree, Trie/Prefix Tree, Balancced Search Tree, AVL Tree, Red-Black Tree | RC3 | Kunyi |
| Graph, Minimum Spanning Tree, Shortest Path Problem, Dynamic Programming | RC4 | Chongye |
| Final Review | Part1, Part2, Part3 | TA Group |
-
Syllabus: Syllabus of ECE2810J 2023 FA
-
Grades Distribution
My Suggestions
Data structures are the foudamental knowledges for a CS track student to learn. One may say if a student have taken this course, then can be called as a student majoring in CS. This course not only provide you theoretical concepts but also require your programming skills to actualize these abstract desgins. The only way to pass this course is to understand the origin of each structure, the detailed implementation of it, the pros and cons of it, and how to implement it elegantly in c++, java or python.
This course plays an important role in many interviews, not only interns but also graduate programs. Although it may become useless if your interests are deep learning or computer architecture, it will frequently appear in every corner of your future study. Therefore, take it seriously and make it.