Instructor: 顏嗣鈞

E-mail:  hcyen(_at_)ntu.edu.tw

Time:  9:10-12:00 AM, Monday

Place: Room BL-112

(2) 吳治緯  明達館 531室  asd24372025@gmail.com

                     (02) 3366-3662

Announcements

• 期中考、期末考、作業1-5、程式:  成績登錄 (1/20/2020 更新) 

• 期末考成績如有問題，可於 1/20 (一) 10:00 -11:00 AM 至計算機及資訊網路中心二樓220 看考卷

• 作業五有位同學沒寫姓名(掃描檔)，請盡快和吳助教聯絡

• Final exam solutions

• Office hours for final exam:

•       吳治緯 明達館 531室  1/3 (五) 9:00 - 12:00 AM

        顏玓德 博理館606室   1/3 (五) 2:00 - 5:00 PM

        顏嗣鈞 計算機及資訊網路中心二樓220  1/2 (四) 10:00 - 12:00 AM

  　

• Final Exam: Monday 1/6, 9:10 - 12:00

• 期末考範圍: (Amortized Analysis of Splay Trees、2-3 & 2-3-4 Trees、Red-black Trees and AA-Trees、Skip Lists)    (Priority Queue, Binary Heaps 、Binomial Heaps、Fibonacci Heaps、Leftist Heaps and Skew Heaps)    (Hashing)    (Disjoint Set Union & Find) (Sorting)    (Graph.ppt:  excluding shortest path algorithms)

• Homework #5: (Solutions 吳治緯) due Dec. 30, 2019

• Sample final exam: (Spring 2019) (Spring 2018) (Spring 2017) (Spring 2016)  (Spring 2015) (Spring 2014), (Spring 2010), (Spring 2007)  (Fall 2004; Solutions) (Fall 2003 ) (Spring 2003)  (Fall 2000)

• Homework #4: (Solutions 顏玓德) due Dec. 16, 2019

• Programming Assignment #1 (顏玓德);   (Due: Jan.  3, 2020)  Note; Additional note;   Input (Input 格式參見additional note 說明)

• Homework #3: (Solutions 吳治緯) due Nov. 25, 2019

• Midterm Exam  (Solutions): Monday 11/11, 9:10 - 12:00

• Office hours for midterm:

       顏玓德 博理館606室  11/7 (四) 2:00 - 5:00 PM

      吳治緯 明達館 531室  11/8 (五) 9:00 - 12:00 AM

      顏嗣鈞 計算機及資訊網路中心二樓220  11/8 (五) 2:30 - 5:00 PM

• Sample midterms (Fall 2000, Solutions) (Spring 2003 , Solutions) (Fall 2003, Solutions) (Fall 2004) (Spring 2007, Solutions) (Spring 2010)(Spring 2014)(Spring 2015)(Spring 2016) (Spring 2017) (Spring 2018) (Spring 2019)

• Homework #2: (Solutions 吳治緯) due Oct. 28, 2019

• Homework #1: (Solutions 顏玓德) due Oct. 14, 2019

Class Notes:

Textbook: There is no required textbook for this class.  There are some relevant and useful books and materials:

• Mark Allen Weiss, Data Structures and Algorithm Analysis in C++. (3rd or 4th Ed.) Addison-Wesley, 2006/2013

• Peter Brass, Advanced Data Structures, Cambridge, 2008;  https://doi.org/10.1017/CBO9780511800191

  http://www-cs.ccny.cuny.edu/~peter/dstest.html

• D. Sheehy, Data Structures

  https://donsheehy.github.io/datastructures/

• Data Structure Visualizations

  https://www.cs.usfca.edu/~galles/visualization/Algorithms.html

Grading:  

• Homework/Prog. Assignment(s): 20-30%

• Midterm exam: 30-40%

• Final exam:  30-40% 

CHEATING: With the exception of group assignments, the work (including homework, programming assignments, tests) must be the result of your individual effort. This implies that one student should never have in his/her possession a copy of all or part of another student's homework. It is your responsibility to protect your work from unauthorized access. Academic dishonesty has no place in a university, in particular, in NTUEE. It wastes our time and yours, and it is unfair to the majority of students. Any form of cheating will automatically result in a failing grade in the course and will be reported to the Dean's office.