|
Academic year 2007/2008, course of
Algorithms and Data Structures. Teaching assistant: Dr.
Marco Vassura.
If you are looking for the version 2008/2009 of this page then follow
this link.
Assessment methods:
- Written test.
- Oral examination.
Dates of the exams (written and oral examination):
- 17/12/08, 9:30 am, Laboratorio C, Via S. Giacomo 9/2
- 27/01/08, 9:30 am, Aula Seminario 2, Piano seminterrato. Dipartimento di Scienze dell'Informazione, Mura Anteo Zamboni, 7
Past exams:
Recommended reading:
- Introduction to Algorithms, Second Edition. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein.
Schedule:
- Tuesday, March 11 [D'Angelo].
- Introduction to the course
[slides].
- Basic data structures: arrays, lists
[slides].
- Monday, March 17 [Vassura].
- Analysis of algorithms and computational cost I (basics)
[slides].
- Tuesday, March 18 [D'Angelo].
- Basic data structures: stacks, queues
[slides].
- Monday, March 31 [Vassura].
- Analysis of algorithms and computational cost II (exercises and examples)
[tutorial].
- Tuesday, April 01 [D'Angelo].
- Basic data structures: trees, visits
[slides].
- Monday, April 07 [Vassura].
- Basic data structures: lists (exercises and examples)
[tutorial].
- Tuesday, April 08 [D'Angelo].
- Data structures: sets, dictionaries, hash tables
[slides].
- Monday, April 14 [Vassura]: RESCHEDULED.
- Tuesday, April 15 [D'Angelo].
- Data structures: graphs and visits
[slides].
- Thurdsday, April 17 [Vassura].
- Monday, April 21 [Vassura].
- Data structures: sets, dictionaries, hash tables (exercises and examples)
[tutorial].
- Tuesday, April 22 [D'Angelo].
- Data structures: graphs, trees (exercises and examples)
[slides].
- Monday, April 28 [Vassura].
- Tuesday, April 29 [D'Angelo].
- Design of algorithms, techniques: divide-et-impera
- Examples: binary search
[slides].
- Examples: merge-sort, quick-sort
[slides].
- Monday, May 05 [Vassura].
- Design of algorithms, techniques: dynamic programming
[slides].
- Tuesday, May 06 [D'Angelo].
- Monday, May 12 [Vassura].
- Examples and exercises on the whole program
[tutorial].
|
|
|
|
|