![]() | ![]() | ||||||||||||||||
Home » Lehre » SS2006 » Theory I - Part 1: | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Navigate | :: Unit Home Lecture & Tutorial Schedule |
| Week | Date | Theme | Remarks |
| 1 | 24 Apr | [Theme 1-1] -- Dictionaries: Search trees | |
| 25 Apr | [Theme 1-1] -- Dictionaries: Balanced trees (AVL trees) | » Exercise Sheet 01 » Due Tue 2 May (2pm). | |
| 2 | 1 May | No class -- Labour day | |
| 2 May | [Theme 1-2] -- Dictionaries: Hashing | » Exercise Sheet 02 » Due Mon 8 May (11am). | |
| 3 | 8 May | [Theme 1-3] -- Dictionaries: Dynamic Tables | » Exercise Sheet 03 » Due Mon 15 May (11am). |
| 9 May | [Theme 2-1] -- Priority queues: Fibonacci heaps [Tutorial session 1] -- Revision of exercise sheets 1 & 2 | ||
| 4 | 15 May | [Theme 2-1] -- Priority queues: Fibonacci heaps [Theme 2-2] -- Priority queues: Shortest path problem | » Exercise Sheet 04 » Due Mon 22 May (11am). |
| 16 May | [Theme 3] -- Randomization [Tutorial session 2] -- Revision of exercise sheets 2 & 3 | ||
| 5 | 22 May | [Theme 4-1] -- String processing: Text search (KMP, BM) [Theme 4-2] -- String processing: Editing distance | |
| 23 May | [Theme 4-3] -- String processing: Suffix trees [Tutorial session 3] -- Revision of exercise sheet 4 | ||