Gabriele D'Angelo, PhD, Assistant Professor. University of Bologna.   [Read in order to live] G. Flaubert italiano        home
contacts | publications | activities | teaching	Last update:   June 26, 2009

Academic year 2008/2009, course of Algorithms and Data Structures. Teaching assistant: Dr. Marco Vassura. The old version (2007/2008) of this page is still available following this link. Assessment methods: Written test. Oral examination. Dates of the exams (written and oral examination): 09/07/09. Written test: 10 am, Laboratorio C, Via S. Giacomo 9/2. Oral examination: 2 pm, Ufficio 9 via Malaguti 1/D. 09/09/09. Written test: 10 am, Aula Erconali 3. Oral examination: 2 pm, Ufficio 9 via Malaguti 1/D. 22/09/09. Written test: 10 am, Aula Erconali 3. Oral examination: 2 pm, Ufficio 9 via Malaguti 1/D. Past exams: 08/07/2008. 25/07/2008. 12/09/2008. Recommended reading: Introduction to Algorithms, Second Edition. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein. Schedule: Monday, March 12 [D'Angelo]. Introduction to the course [slides]. Basic data structures: arrays, lists [slides]. Tuesday, March 13 [Vassura]. Analysis of algorithms and computational cost [slides]. Monday, March 23 [Vassura]. Computational complexity [tutorial-1], [tutorial-2]. Tuesday, March 18 [D'Angelo]. Basic data structures: stacks, queues [slides]. Monday, March 30 [Vassura]. Basic data structures: lists, stacks and queues (exercises and examples) [tutorial-1], [tutorial-2]. Tuesday, March 31 [D'Angelo]. Basic data structures: trees, visits [slides]. Monday, April 06 [Vassura]. Basic data structures: lists and trees (exercises and examples) [tutorial]. Tuesday, April 07 [D'Angelo]. Data structures: sets, dictionaries, hash tables [slides]. Monday, April 20 [Vassura]. Data structures: sets, dictionaries, hash tables (exercises and examples) [tutorial-1], [tutorial-2]. Tuesday, April 21 [D'Angelo]. Data structures: graphs and visits [slides]. Monday, April 27 [Vassura]. Recurrence equations [tutorial]. Tuesday, April 28 [D'Angelo]. Data structures: graphs, trees (exercises and examples) [slides]. Priority queues, heaps [slides]. Monday, May 04 [Vassura]. Design of algorithms, techniques: dynamic programming [slides]. Tuesday, May 05 [D'Angelo]. Design of algorithms, techniques: divide-et-impera Examples: binary search [slides]. Examples: merge-sort, quick-sort [slides ppt], [slides pdf]. Thursday, May 07 [D'Angelo]. Design of algorithms, techniques: greedy [slides], Huffman codes [slides]. Tuesday, May 12 [Vassura]. Examples and exercises on the whole program [tutorial].

Office hours Ask appointment by e-mail.

	1975 - 2021 Gd'A Contact me | Warning