| CSCI2100B Data Structures | |||||||||||||||||||||||||||||||||||||||||||||
|
Offered by Yufei Tao, Spring 2025. Tutors: Hao Chen (hchen22@link.cuhk.edu.hk), Xingyu Cui (xycui24@cse), and Zeju Li (lizeju@link.cuhk.edu.hk). Offices and Consultation Hours:
[Lecture Notes][Tutorials][Regular Exercises][Special Exercises][Quizzes and Exams][Project] |
|||||||||||||||||||||||||||||||||||||||||||||
| Brief Description | |||||||||||||||||||||||||||||||||||||||||||||
|
In this course, we will study fundamental data structures and algorithms. Such knowledge is at the core of computer science and allows us to write faster programs, especially programs whose running time has attractive worst-case bounds. Techniques for analyzing the performance of algorithms will also be discussed in detail. Tentative topics to be covered include searching in ordered lists, hashing, sorting, priority queues, binary search trees, fundamental graph algorithms, and so on. |
|||||||||||||||||||||||||||||||||||||||||||||
| Announcements | |||||||||||||||||||||||||||||||||||||||||||||
|
News 11 (14 Feb): Quiz 1 scores have been posted on Blackboard. The solutions and statistics can be found at the bottom of the page. You may now collect your Quiz 1 papers. To do so, please locate the TA assigned to your ID from the list provided below. Then, visit their offices during the designated consultation periods. If needed, you may also consider reaching out to the TA via email to request a special appointment. Please note that it is at the TA's discretion to decide whether to grant your request.
The lecture on Mar 25, however, will be canceled. News 9 (21 Jan): The scope of Quiz 1 covers everything in Lectures 1-6. News 8 (9 Jan): Given that 27 Jan is very close to the Lunar New Year, Quiz 1 will be rescheduled to the lecture on 4 Feb (Tue, Week 4). News 7 (7 Jan): Regular exercise 1 and Special exercise 1 have been released. Please find them at the bottom of the page. There will be no more reminders for exercise releases. Please check this page periodically. News 6 (7 Jan): Tutorials will start from Week 2 (no tutorials on Jan 8 and 9). News 5 (7 Jan): The video for Tue's lecture is now available. In general, lecture videos will be released as long as they are captured successfully. Remember: videos are supplemental and cannot be guaranteed. There will be no more announcements regarding video releases. Please check this page periodically. News 4 (5 Jan): Sick Leave Policy for Tests In the unfortunate event that you are seriously ill on the day of a quiz or an exam, you can be absent from the test provided that the following conditions are satisfied.
News 3 (5 Jan): Please note the test schedule for this course: Quiz 1 (20 minutes) is to be held in the lecture of Quiz 3 (20 minutes) in the lecture of 14 Apr (Mon, Wed 13). News 2 (5 Jan): Tutorial Session T03 has been merged into T01. Previously, T03 was scheduled to take place in Y.C. Liang Hall 103 every Wed from 5:30pm to 6:15pm. The new location will be Science Centre LG23, and the time remains unchanged. News 1 (5 Jan): Hello, all. |
|||||||||||||||||||||||||||||||||||||||||||||
| Time, Venues, and Zoom Links | |||||||||||||||||||||||||||||||||||||||||||||
|
Lectures
|
|||||||||||||||||||||||||||||||||||||||||||||
| Grading Scheme | |||||||||||||||||||||||||||||||||||||||||||||
|
In-Class Quiz 1: 5% In-Class Quiz 2: 5% In-Class Quiz 3: 5% Midterm Exam: 20% Coding Project: 15% Final Exam: 50% Exam Style: During this course, the instructor will gradually generate a list of special exercises with no solutions given. In the midterm and final exams, 35% of the marks will come from problems taken directly from that list. The rest 65%, however, will be from new problems. In the midterm and the final exams, you will be allowed to bring in a single-sided, A4-sized, note sheet on which you can print/write anything you deem useful. |
|||||||||||||||||||||||||||||||||||||||||||||
| Lecture Notes and Textbook | |||||||||||||||||||||||||||||||||||||||||||||
|
The instructor recommends the following textbook: Introduction to Algorithms, 3rd Edition. By Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Ownership of the book is not compulsory. The instructor will make lecture notes available before each lecture. His notes will be self-contained, namely, containing all the details required in this course. Lecture attendance is vital to grasp the material taught.
|
|||||||||||||||||||||||||||||||||||||||||||||
| Tutorial Material | |||||||||||||||||||||||||||||||||||||||||||||
|
|||||||||||||||||||||||||||||||||||||||||||||
| Regular Exercises | |||||||||||||||||||||||||||||||||||||||||||||
|
The instructor has prepared the following exercises which he believes are useful for students to consolidate their understanding of the course material. Unlike the "special" exercises (see the next section), solutions to these "regular" exercises are provided in full. Exercises carrying one or more stars ("*") may be difficult. The more stars, the more difficult. List 1 (Solutions). List 2 (Solutions). List 3 (Solutions). List 4 (Solutions). List 5 (Solutions). Additional exercises in the textbook [Growth of Functions] Exercises 2.2-1, 3.1-2, 3.1-3, 3.1-4, 3.2-4, 3.2-8. [Sorting] Exercises 8.1-3*, 8.1-4*, 8.2-4, 8-5*. [k-Selection] Exercises 9.3-6, 9.3-9, Problem 9-2. [Linked List] Exercises 10.2-6. |
|||||||||||||||||||||||||||||||||||||||||||||
| Special Exercises | |||||||||||||||||||||||||||||||||||||||||||||
|
As mentioned earlier, some problems in the final exam of CSCI2100 will be taken directly from the special exercise lists below. No solutions to these exercises will be given. You are free to look for the solutions in any way. List 1. List 2. List 3. List 4. List 5. |
|||||||||||||||||||||||||||||||||||||||||||||
| Quizzes and Exams | |||||||||||||||||||||||||||||||||||||||||||||
|
Quiz 1: Solutions Average = 64, standard deviation = 21.3. |
|||||||||||||||||||||||||||||||||||||||||||||
|
|