8/10/2019 ee ntu

1/2

DataStructures and Programming

Spring 2010

Instructor: Class: Monday: 9:10-12 AM, Room BL-112 ()Office: BL-525 ()Phone: 3366-3581E-mail: yen@cc.ee.ntu.edu.twOffice Hours: By appointmentClass Web page: http://cc.ee.ntu.edu.tw/~yen/courses/ds10.htmlTA: 603 chiangchi@arbor.ee.ntu.edu.tw

PREREQUISITES: Familiarity in C, C++, or JAVA.

ANNOUNCEMENTS:

(Updated 3:30 PM, 7/5)(7/2) 5:00~6:00 603

E-mail ()

Final exam will be held on June 21. : Chapter 6: 213-225 229-250 Chapter 8: 315-331 Chapter 11: 491-513

Chapter 12: 525-534 540-549, and class notes

Sample final exam: (Spring 2007) (Fall 2004: Final Exam Solutions) (Fall 2003: FinalExam; Solutions ) (Spring 2003) (Fall 2000: exam, solution)

Programming assignments (Instructions)

Assignment # 1 (input data) (pdf) (ps) due: May 17 (Monday)

Assignment # 2: (description) due: June 27 (Sunday 23:59 PM)

strict

Homework # 1: (Solutions) Due: April 12 (Monday)

Homework # 2: (Solutions) Due:May 24 (Monday) Midterm exam will be held on April 26. (midterm solution) : Chapter 2: 43-63 Chapter 3: 71-74, 83-107 Chapter 4: 113-159 Chapter 12:

517-525 and class notes

Sample midterms (Fall 2000, Solutions) (Spring 2003)(Fall 2003, Solutions) (Fall 2004)(Spring 2007,Solutions)

TOPICS:PRELIMINARIES:(1 ) Introduction, (2) Asymptotic Notations, (3) Algorithm Analysis.ABSTRACT DATA TYPES:(4) Stacks, Queues, Lists, List operations, List representations, List

traversals, Doubly linked lists.

http://cc.ee.ntu.edu.tw/~yen/courses/ds07/Solution_DSmidterm2007Spring.pdfhttp://cc.ee.ntu.edu.tw/~yen/courses/ds10/hw2.pdfhttp://cc.ee.ntu.edu.tw/~yen/courses/ds10/hw2.pdfhttp://www.ee.ntu.edu.tw/~yen/courses/ds10/hw1.pdfhttp://cc.ee.ntu.edu.tw/~yen/courses/ds10/hw1_sol.pdfhttp://cc.ee.ntu.edu.tw/~yen/courses/ds10/instructions.htmhttp://www.ee.ntu.edu.tw/~yen/courses/ds-03/restricted/ds03-final.dochttp://www.ee.ntu.edu.tw/~yen/courses/ds-03/restricted/ds03-final.dochttp://www.ee.ntu.edu.tw/~yen/courses/ds-03/restricted/ds03-final.dochttp://www.ee.ntu.edu.tw/~yen/courses/ds-03/restricted/ds03-final.dochttp://cc.ee.ntu.edu.tw/~yen/courses/ds10/DS-2010-grades.htmhttp://cc.ee.ntu.edu.tw/~yen/courses/ds10http://www.ee.ntu.edu.tw/~yen/courses/ds04.htmlhttp://cc.ee.ntu.edu.tw/~yen/courses/ds-03/midterm-spring-03.pdfhttp://www.ee.ntu.edu.tw/~yen/courses/ds04.htmlhttp://cc.ee.ntu.edu.tw/~yen/courses/ds07/Solution_DSmidterm2007Spring.pdfhttp://www.ee.ntu.edu.tw/~yen/courses/ds07/restricted/AsymptoticAnalysis07.ppthttp://cc.ee.ntu.edu.tw/~yen/courses/ds07/midterm-Sping07.pdfhttp://www.ee.ntu.edu.tw/~yen/courses/ds-03/restricted/ds03-final.dochttp://cc.ee.ntu.edu.tw/~yen/courses/ds10/PROG1.pshttp://www2.ee.ntu.edu.tw/~yen/courses/ds07/ds-final-sol.pdfhttp://cc.ee.ntu.edu.tw/~yen/courses/ds10/DS-2010-grades.htmhttp://cc.ee.ntu.edu.tw/~yen/courses/ds-03/midterm-00-sol.pdfhttp://www.ee.ntu.edu.tw/~yen/courses/ds07/restricted/AlgorithmAnalysis07.ppthttp://cc.ee.ntu.edu.tw/~yen/courses/ds10http://cc.ee.ntu.edu.tw/~yen/courses/ds10/hw2_sol.pdfhttp://cc.ee.ntu.edu.tw/~yen/courses/ds10/prog-2.htmhttp://cc.ee.ntu.edu.tw/~yen/courses/ds10/hw2.pdfhttp://www.ee.ntu.edu.tw/~yen/courses/ds-03/final-exam-sol.dochttp://cc.ee.ntu.edu.tw/~yen/courses/ds-03/ds-midterm-04.pdfhttp://cc.ee.ntu.edu.tw/~yen/courses/ds-03/midterm-fall-03-sol.pdfhttp://cc.ee.ntu.edu.tw/~yen/courses/ds10/hw1_sol.pdfhttp://www.ee.ntu.edu.tw/~yen/courses/ds07/restricted/Introduction10.ppthttp://cc.ee.ntu.edu.tw/~yen/courses/ds10/prog-1.pdfhttp://www.ee.ntu.edu.tw/~yen/courses/ds10/hw1.pdfhttp://cc.ee.ntu.edu.tw/~yen/courses/ds-03/midterm-00.pdfhttp://cc.ee.ntu.edu.tw/~yen/courses/ds10/2007-ds-final.pdfhttp://cc.ee.ntu.edu.tw/~yen/courses/ds-03/midterm-fall-03.pdfhttp://cc.ee.ntu.edu.tw/~yen/courses/ds10/instructions.htmhttp://www2.ee.ntu.edu.tw/~yen/courses/ds-03/ds03-final-sol.pdfhttp://www.ee.ntu.edu.tw/~yen/courses/ds2000/final-sol.pdfhttp://cc.ee.ntu.edu.tw/~yen/courses/ds10/midterm-sol.pdfhttp://www.ee.ntu.edu.tw/~yen/courses/ds04.htmlhttp://www.ee.ntu.edu.tw/~yen/courses/ds07/restricted/LinearDataTypes07.ppthttp://cc.ee.ntu.edu.tw/~yen/courses/ds10/data.htmhttp://www.ee.ntu.edu.tw/~yen/courses/ds-03/ds00-final-exam.pdfhttp://www2.ee.ntu.edu.tw/~yen/courses/ds07/DS-final-exam-04.pdf

8/10/2019 ee ntu

2/2

TREES:(5, 6) Tree operations, Tree representations, Tree traversals, Threaded trees, Binary trees,(7) AVL trees, (8) (9) Splay trees, (10) 2-3 trees, B-trees, Red-black trees, Binomial trees, (11)AA-trees and more.

HASHING:(25) Chaining, Open addressing, Collision handling.PRIORITY QUEUES: (12) Binary heaps. (13) Binomial heaps. (14) Fibonacci heaps. (15a, 15b)

Leftist heaps, Skew heaps, (16) Min-max heaps.. (17) Pairing heapsAMORTIZED ANALYSIS (18, 19, 20)SORTING: Insertion sort, Selection sort, Quicksort, Heapsort, Mergesort, Shellsort, Lower bound

of sorting.DISJOINT SETS: (21, 22) Set operations, Set representations, Union-find, Path compression.GRAPHS:Graph operations, Graph representations, Basic graph algorithms, Algorithm design

techniques.ADVANCED DATA STRUCTURES: Tries, (24) Skip lists (23), Treaps, Top-down splay trees.

TEXTBOOKMark Allen Weiss, Data Structures and Algorithm Analysis in C++. (3rd Ed.)Addison-Wesley, 2006

COURSE REQUIREMENTS: There will be homework/programming assignments, one midterm

exam, and a final exam. The weightings within the semester grade will be:

Homework + Programming Assignment 30% Midterm35% Final exam 35%

HOMEWORK: Only homework/prog. assignments turned in by the due date is guaranteed to begraded. Any special circumstances that cause difficulty in meeting the deadlines should be brought tothe attention of the instructor in advance.

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 onestudent should never have in his/her possession a copy of all or part of another student's homework. Itis 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 themajority of students. Any form of cheating will automatically result in a failing grade in the courseand will be reported to the Dean's office.

http://www.ee.ntu.edu.tw/~yen/courses/ds-03/restricted/SkipLists.ppthttp://www.ee.ntu.edu.tw/~yen/courses/ds-03/restricted/skew-heap-analysis.pdfhttp://www.ee.ntu.edu.tw/~yen/courses/ds-03/restricted/disjoint-set-amortized-analysis.pdfhttp://www.ee.ntu.edu.tw/~yen/courses/ds-03/restricted/Amortized%20Analysis.pdfhttp://www.ee.ntu.edu.tw/~yen/courses/ds-03/restricted/min-max-heaps.ppthttp://www.ee.ntu.edu.tw/~yen/courses/ds07/restricted/Top.pdfhttp://www2.ee.ntu.edu.tw/~yen/courses/ds07/restricted/Treap.ppthttp://www.ee.ntu.edu.tw/~yen/courses/ds-03/restricted/pairing-heaps.ppthttp://www.ee.ntu.edu.tw/~yen/courses/ds-03/restricted/LeftistSkewHeaps.ppthttp://www.ee.ntu.edu.tw/~yen/courses/ds-03/restricted/binomial-heaps-04.ppthttp://www.ee.ntu.edu.tw/~yen/courses/ds-03/restricted/amortized-3.ppthttp://www.ee.ntu.edu.tw/~yen/courses/ds-03/restricted/fibonacci-heaps-04.ppthttp://www.ee.ntu.edu.tw/~yen/courses/ds07/restricted/heap.ppthttp://www.ee.ntu.edu.tw/~yen/courses/ds-03/restricted/amortized-2.ppthttp://www.ee.ntu.edu.tw/~yen/courses/ds07/restricted/2-3-4-trees.ppthttp://www.ee.ntu.edu.tw/~yen/courses/ds07/restricted/bst07.ppthttp://www.ee.ntu.edu.tw/~yen/courses/ds-03/restricted/constant-space-scanning.ppthttp://www.ee.ntu.edu.tw/~yen/courses/ds07/restricted/avl-tree07-1.ppthttp://www.ee.ntu.edu.tw/~yen/courses/ds-03/restricted/hashing04.ppthttp://www.ee.ntu.edu.tw/~yen/courses/ds07/restricted/Splay-trees.ppthttp://www.ee.ntu.edu.tw/~yen/courses/ds-03/restricted/union-find.ppthttp://www.ee.ntu.edu.tw/~yen/courses/ds-03/restricted/AA-trees-04.ppt