Data Structures

EE2410: Data Structures
Cheng-Wen Wu
Spring 2000 [e-mail] http://larc.ee.nthu.edu.tw/˜cww/n/241

Class Hours: W5W6R6 (Rm 208, EECS Bldg) Requirements
The prerequites for the course are EE 2310 & EE 2320, i.e., Computer Programming (I) & (II). I assume that you have been familiar with the C programming language. Knowing at least one of C++ and Java is recommended.

Course Contents
1. Introduction to algorithms [W.5,S.2] 2. Recursion [W.7,S.14] 3. Elementary data structures: stacks, queues, lists, and trees [S.3-8] 4. Sorting [W.8] 5. Searching [CLR.10,CLR.12,CLR.14] 6. Advanced data structures: balanced trees and heaps [S.9,S.11] 7. Graphs and their applications [S.12]

Textbook (required): [S] Sahni Data Structures, Algorithms, and Applications in C++, McGraw-Hill,
1998 (ISBN 0-07-109219-6).

References (optional): [W] Weiss, Algorithms, Data Structures, and Problem Solving with C++, Addison Wesley, 1996 (ISBN 0-8053-1666-3). [CLR] Cormen, Leiserson, and Rivest, Introduction to Algorithms, McGraw-Hill, 1990 (ISBN 0-07-0131430). [TS] Standish, Data Structures in Java, Addison Wesley, 1998 (ISBN 0-201-30564-X).

Homework Assignments
There are two types of homework assignments: written assignments and programming assignments. Despite the fact that the problem sets account for only 30% of the grade, they form an important part of the course. You should prepare to spend an average of at least 5 hours on the homework problems each week. Warning: If you do not do substantially the problem sets, then do not expect to pass. You are encouraged to collaborate in study groups on the solution of the homework. However, you must write up solutions on your own. Plagiarism and other antiintellectual behavior will be dealt with severely.

Grading: Written assignments 15%, programming assignments 15%, midterm exam 30%, final exam 40%.

References: (optional): [W] Weiss, Algorithms, Data Structures, and Problem Solving with C++, Addison Wesley, 1996 (ISBN 0-8053-1666-3). [CLR] Cormen, Leiserson, and Rivest, Introduction to Algorithms, McGraw-Hill, 1990 (ISBN 0-07-0131430). [TS] Standish, Data Structures in Java, Addison Wesley, 1998 (ISBN 0-201-30564-X). Homework Assignments There are two types of homework assignments: written assignments and programming assignments. Despite the fact that the problem sets account for only 30% of the grade, they form an important part of the course. You should prepare to spend an average of at least 5 hours on the homework problems each week. Warning: If you do not do substantially the problem sets, then do not expect to pass. You are encouraged to collaborate in study groups on the solution of the homework. However, you must write up solutions on your own. Plagiarism and other antiintellectual behavior will be dealt with severely. Grading: Written assignments 15%, programming assignments 15%, midterm exam 30%, final exam 40%.