一、課程說明 (Course Description)
<br>
<br>This course introduces some classical and smart methods to store the data so 
<br>that we can answer questions about the data efficiently. As an example, let us 
<br>imagine that we have the exam scores of all students, and from time to time 
<br>different student would ask how many other students get a higher score than 
<br>him/her. In order to speed up the query, one may store the scores in sorted 
<br>order rather than in a random order. 
<br>
<br>Our focus will be on both the theoretical performance and the practical 
<br>implementation of the data structures. 
<br>
<br>
<br>二、指定用書 (Text Book)  
<br>    1. Introduction to Algorithms, 3rd edition, MIT Press, by T. Cormen, C. E. 
<br>Leiserson, and R. L. Rivest 
<br> 
<br>三、參考書籍 (References)   
<br>    1. Algorithms in C++, (or Algorithms in Java), by R. Sedgewick
<br>    2. The Art of Computer Programming, by D. E. Knuth
<br>    3. Fundamentals of Data Structures in C++, by E. Horowitz, S. Sahni, and 
<br>D. Mehta
<br>
<br>四、教學方式 (Teaching Method)  
<br>    Home Study + Classroom Discussion + Online Discussion    
<br>
<br>五、教學進度 (Syllabus)
<br>
<br>Tentative topics to be covered:
<br>
<br> 1. Growth of Functions
<br> 2. Arrays
<br> 3. Heaps
<br> 4. Sorting
<br> 5. Lists, Stacks, and Queues
<br> 6. Trees and Graphs
<br> 7. Searching Set Data
<br> 8. Hashing
<br>
<br>六、成績考核 (Evaluation)   
<br>    
<br> 4 Assignments (Written + Programming)       40%
<br> 2 Exams       (Programming)                 60%
<br> -------------------------------------------------
<br> Total                                       100%
<br>
<br>