I. Teaching Plan:
<br>
<br>
<br>
<br>1. Comparison-ba<x>sed Dictionary (2 weeks)
<br>   li<x>nked List, Array, BST, B-Tree, Wavelet Tree
<br>
<br>2. Word-RAM Dictionary (4 weeks)
<br>   Bit Vector, Hashing, veB tree, x-fast, y-fast, Succinct Dictionaries
<br>
<br>3. Geometric Queries  (3 weeks)
<br>   Range Search, Stabbing
<br>       
<br>4. Succinct Trees  (3 weeks)
<br>
<br>5. Strings (3 weeks)
<br>   Suffix Tree, Suffix Array, BWT, XBW, GBWT
<br>
<br>
<br>
<br>---------------------------------------
<br>
<br>II.  Teaching Materials and References
<br>
<br>
<br>
<br>
<br>1. Introduction to Algorithms, MIT Press
<br>
<br>2. Research Papers
<br>
<br>3. Web Resources: OCW, Wikipedia
<br>
<br>
<br>
<br>
<br>
<br>---------------------------------------
<br>
<br>III. Evaluation Method:
<br>
<br>
<br>
<br>
<br>-- 4 to 6 Homeworks  (40% in total)
<br>
<br>-- 3 Exams           (60% in total)
<br>
<br>
<br>---------------------------------------