Models for the evaluation of algorithms. Analytical instruments. Problem ‐ solving strategies: “Brute Force”, “Divide and Conquer”, “Diminish and Conquer”, “Transform and Conquer”, “Space ‐ time trade ‐ off”, “Greedy Strategy”, Study and analysis of algorithms and data structures: sorting and searching, sequential structures, trees and heaps, hash tables, string and text analysis.
T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein ‐ Introduzione agli algoritmi e strutture dati ‐ 3a Edizione ‐ McGraw ‐ Hill; A. Levitin ‐ Introduction to The Design and Analysis of Algorithms ‐ 2nd edition ‐ Addison ‐ Wesley; S. Skiena ‐ The Algorithm Design Manual ‐ 2nd edition – Springer; R. Sedgewick ‐ Algorithms in C++ ‐ 3rd edition ‐ Vol 1 ‐ 5 ‐ Addison Wesley
Ricevimento: Every hour following class hours.
ARMANDO TACCHELLA (President)
GIUSEPPE CICALA
ENRICO GIUNCHIGLIA
MARCO MARATEA
MASSIMO NARIZZANO
DESIGN AND ANALYSIS OF ALGORITHMS
Computer ‐ based test and interview
Capability to frame solutions of computational problems through algorithms, and analyze the correctness and the performances of the solutions with analytical means.
