Revision as of 03:25, 24 February 2019

Announcement

For all: Wednesday, Week 2 - ?

For beginers: Sunday, Week 2 - ?

Hopefully, we will cover most of the important and nice points in the textbook.

Lecture 1 (Week 8): Enumerating skills; dynamic programming. (Textbook 2.1, 2.3)
Lecture 2 (Week 9): Mathematics fundamentals.
Lecture 3 (Week 10): (Advanced) Data Structures.
Lecture 4 (Week 11): Computational Geometry.
Lecture 5 (Week 12): Graph Theory.
Lecture 6 (Week 13): Misc.
Lecture 7 (Week 14): Misc.

You can do the exercises before the lecture, or after, as you like.

Hopefully we will discuss about the exercises from the last lecture before every lecture.

@@ Line 18: / Line 18: @@
 * Lecture 6 (Week 13): Misc.
 * Lecture 7 (Week 14): Misc.
-= Readings =
-You should do the reading '''BEFORE''' the lecture, otherwise you would probably have a lot of confusions.
-* BEFORE Lecture 1: Textbook 1.1 - 1.6, 2.1 - 2.3
-* BEFORE Lecture 3: [https://acm.ecnu.edu.cn/upload/mirror/cache/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84.pptx PPT], [https://acm.ecnu.edu.cn/upload/mirror/cache/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%841.pptx PPT0] [https://zerolin.gitbooks.io/template/content/ Template]
-* AFTER Lecture 5: [https://acm.ecnu.edu.cn/upload/mirror/cache/%E5%9B%BE%E8%AE%BA%E5%85%A5%E9%97%A8%E8%BF%9B%E9%98%B6.pptx PPT]
-* AFTER Lecture 7: [[Media:Learning_strategies_of_ACM-ICPC.pdf|slides]]
 = Exercises =