Course Details for A.Y. 2014/2015
Name:
Algoritmi e Strutture Dati II / Algorithms and Data Structures II
Basic information
Credits:
: Master Degree in Computer Science 6 CFU (b)
Degree(s):
Master Degree in Computer Science 1^{st} anno curriculum SDRC Compulsory
Master Degree in Computer Science 1^{st} anno curriculum ASSC Compulsory
Master Degree in Computer Science 1^{st} anno curriculum General Compulsory
Language:
Italian
Course Objectives
Knowledge of advanced algorithmic techniques; ability to individuate, formalize and solve optimization problems; concept of approximation; ability to classify problems according to their degree of approximability; ability to collaborate for the realization of applicative projects in group.
Course Content
 Review of computational complexity and intractability. Optimization problems. Approximation algorithms.
 Algorithmic techniques: greedy.
 Algorithmic techniques: local search and dynamic programming.
 Linear programming techniques: rounding and primaldual methods
 Polynomial Time Approximation Schemes (PTAS) and Fully Polynomial Time Approximation Schemes (FPTAS).
 Negative approximation results and gap technique. Complexity classes for optimization problems and their inclusions
Learning Outcomes (Dublin Descriptors)
On successful completion of this course, the student should

Acquire knowledge of advanced algorithmic techniques for NPHard optimization problems. In particular, the student will
have mastery command of main algorithmic (approximation) techniques like greedy, local search, dynamic programming, linear programming: rounding and primaldual methods, Polynomial Time Approximation Schemes (PTAS) and Fully Polynomial Time Approximation Schemes (FPTAS). Moreover the student will acquire knowledge on negative approximation results and gap technique, and therefore on the complexity classes for optimization problems.

Acquire the ability of abstracting models and formal algorithmic problems from real computational problems, understanding the degree of approximability and designing efficient algorithmic solutions.

Acquire autonomy in individuating, formalizing and understanding the degree of approximability of real computational problems and identify independently their most efficient solutions.

Being able to understand complex algorithms solutions and to formal proving performances of their algorithmic solutions for complex computational problems.

The course aims to develop in graduate students competencies and abilities necessary in their future studies and/or works, especially with respect to doctoral studies and in general to any research activity on algorithmic topics.
Prerequisites and Learning Activities
KNOWLEDGE: fundamentals of programming, discrete mathematics, algorithms and data structures, computer architectures, reading and understanding of the English language
SKILLS: ability to integrate classroom and homework study, ability to interact with the teacher during the class for originating discussion.
Assessment Methods and Criteria
Written test followed by an oral exam.
An optional midterm written test will be also provided, which is meant to cover the first part of the course, in order to help the students to split the workload. If a student passes the midterm written exam, she will take a finalterm written exam concerned with the second part of the course content only.
The midterm written exam (lasting 2 hours) consists of exercises and open questions concerning the first part of the course content.
The finalterm written exam is split into two parts (each lasting one hour and half), each consisting of exercises and open questions, concerning the first and the second part of the course content, respectively. Students who passed the midterm part will have to take only the second part.
The final result of the written exam will be given by the average result of the two parts.
The oral exam will occur within the same exam session of the written test, and it will typically cover the areas of the written answers that need clarification, plus a subject of one's choice. The oral exam (max 1 hour) will test the student's ability to engage in discussion of issues relevant to the topics discussed during the course. Criteria of evaluation will be the level of knowledge and the fluency in the technical language of algorithms and computational complexity.
Textbooks
 Vijay V. Vazirani, Approximation Algorithms , Springer. 2001. ISBN: 3540653678
 G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. MarchettiSpaccamela, M. Protasi, Complexity and Approximation , Springer. 1999. ISBN: 3540654313
Course page updates
This course page is available (with possible updates) also for the following academic years:
To read the current information on this course, if it is still available, go to the university course catalogue .
Course information last updated on: 23 gennaio 2015, 18:10