Pensum - Algorithms and Datastructures (INF1, Autumn'05)
- Chapter 1 of Algorithmics: The Spirit of Computing by David Harel (available in the course folder for photocopying)
- Chapter 1 of Algorithms and Data Structures: Design, Correctness and Analys
is by Jeffrey H. Kingston (skip page 10)
- Chapter 5 of Algorithmics: The Spirit of Computing by David Harel (available in the course folder for photocopying)
-
Chapter 2 of Algorithms and Data Structures: Design, Correctness and Analysis by Jeffrey H. Kingston [Note: Section on tree traversal can be safely skipped.]
- Chapter 2 of Algorithms and Data Structures: Design, Correctness and Analysis by Jeffrey H. Kingston [Note: Section on tree traversal can be safely skipped.]
- Chapter 4 of Algorithms and Data Structures: Design, Correctness and Analysis by Jeffrey H. Kingston. [Note: Skip the section on Strassen's algorithm.]
- Sections 3.1 - 3.3 of Algorithms and Data Structures: Design, Correctness and Analysis by Jeffrey H. Kingston.
- Section 5.1 of Algorithms and Data Structures: Design, Correctness and Analysis by Jeffrey H. Kingston.
- Sections 5.2 and 5.3 of Algorithms and Data Structures: Design, Correctness and Analysis by Jeffrey H. Kingston
- Sections 6.1, 6.2 and 6.3 of Algorithms and Data Structures: Design, Correctness and Analysis by Jeffrey H. Kingston.
- Sections 7.1, 7.2, 7.3, 7.4, 7.5 and 6.2 (deletion) of Algorithms and Data Structures: Design, Correctness and Analysis by Jeffrey H. Kingston. (You may safely skip the mathematics in the text.)
- Sections 7.7, 7.9, 9.1, 9.2 and 9.3 of Algorithms and Data Structures: Design, Correctness and Analysis by Jeffrey H. Kingston. (You may safely skip the mathematics in the text having to do with average-case complexity of the operations, however, read the worst-case complexity analysis.)
- Sections 9.3 - 9.6, 11.1 of Algorithms and Data Structures: Design, Correctness and Analysis by Jeffrey H. Kingston.
- Sections 11.1., 11.2, 11.3 and 11.4 of Algorithms and Data Structures: Design, Correctness and Analysis by Jeffrey H. Kingston.
- Sections 11.4 (critical paths), 11.5 and 11.6 of Algorithms and Data Structures: Design, Correctness and Analysis by Jeffrey H. Kingston
- Section 12.1 of Algorithms and Data Structures: Design, Correctness and Analysis by Jeffrey H. Kingston.
- Section 12.2 of Algorithms and Data Structures: Design, Correctness and Analysis by Jeffrey H. Kingston.
- All the tutorial exercises (solutions are on the web on-line).