# Computer science | ALGORITHM DESIGN

## Computer science ALGORITHM DESIGN

 0512100043 DIPARTIMENTO DI INFORMATICA EQF6 COMPUTER SCIENCE 2017/2018

 OBBLIGATORIO YEAR OF COURSE 2 YEAR OF DIDACTIC SYSTEM 2015 SECONDO SEMESTRE
SSD CFU HOURS ACTIVITY TYPE OF ACTIVITY INF/01 6 48 LESSONS COMPULSORY SUBJECTS, CHARACTERISTIC OF THE CLASS INF/01 3 24 EXERCISES COMPULSORY SUBJECTS, CHARACTERISTIC OF THE CLASS

 MARCELLA ANSELMO T
Objectives
Knowledge and Understanding
The main goals of this class are the following:
1.To provide the student with general methods and basic knowledge for the design of efficient algorithms
2.To give the students tools for the analysis of resources (space and time) needed by the algorithms
3.To provide a catalogue of the most known and efficient algorithms for basic computational problems (sorting, searching, optimization on graphs and sequences, optimization of resources, etc.)

Applying Knowledge and Understanding
The aim of this class is to make the student capable of abstracting models and formal algorithmic problems from real-life computational problems, and designing efficient algorithmic solutions for them.
Prerequisites
STUDENTS SHOULD HAVE ACQUIRED THE NOTIONS OF MATHEMATICS AS TAUGHT IN PREVIOUS ACADEMIC YEARS AND THE ABILITY TO DEVELOP LOGICAL REASONING. THEY SHOULD ALSO HAVE LEARNED AND MASTERED THE BASIC CONCEPTS OF AN INTRODUCTORY CLASS IN DATA STRUCTURES.
Contents
72 LESSON HOURS:
1.INTRODUCTION TO THE ASYMPTOTIC ANALYSIS OF ALGORITHMS
2.RECURRENCE RELATIONS AND THEIR SOLUTION.
3.THE ALGORITHM DESIGN TECHNIQUE OF DIVIDE-AND-CONQUER WITH RELATED APPLICATION EXAMPLES: MERGESORT, QUICKSORT; RECURRENCES, FAST INTEGER MULTIPLICATION, MEDIAN FINDING, RECURSIVE ALGORITHMS ON BINARY TREES.
4.THE ALGORITHM DESIGN TECHNIQUE OF DYNAMIC PROGRAMMING WITH RELATED APPLICATION EXAMPLES: COMPUTATION OF FIBONACCI NUMBERS, COMBINATIONS; OPTIMIZATION PROBLEMS: SCHEDULING OF RESOURCES, INTEGER KNAPSACK PROBLEM, PROBLEMS ON STRINGS AND SHORTEST PATHS IN GRAPHS
5.THE GREEDY ALGORITHM DESIGN TECHNIQUE WITH RELATED APPLICATION EXAMPLES: SCHEDULING OF INTERVALS; SCHEDULING WITH DEADLINES; DATA COMPRESSION AND HUFFMAN CODES
6.ALGORITHMS ON GRAPHS. CONNECTIVITY AND VISITS OF GRAPHS; DAG AND TOPOLOGICAL ORDERING; SHORTEST PATHS (DIJKSTRA ALGORITHM). MINIMUM SPANNING TREES (PRIM AND KRUSKAL ALGORITHMS)
7.COMPUTATION OF NETWORK FLOW AND ITS APPLICATION
8.INTELLIGENT EXHAUSTIVE SEARCH: BACKTRACKING AND BRANCH-AND- BOUND
Teaching Methods
THIS CLASS INCLUDES THEORETICAL LECTURES WITH THE GOAL OF LEARNING THE BASIC TECHNIQUES FOR THE DESIGN AND ANALYSIS OF ALGORITHMS, AND EXERCISES-BASED LECTURES, IN WHICH IT WILL BE EXPLAINED, WITH PLENTY OF EXAMPLES, HOW THE ACQUIRED THEORETICAL KNOWLEDGE MAY BE USED TO SOLVE ALGORITHMIC PROBLEMS OF PRACTICAL INTEREST.
Verification of learning
THE FINAL GRADE IS EXPRESSED WITH A GRADE X OUT-OF-THIRTY. THE EXAM CONSISTS OF A WRITTEN TEST AND AN ORAL EXAM. THE WRITTEN TEST MAY BE REPLACED BY TWO MID-TERMS. THE WRITTEN TEST TAKES PLACE BEFORE THE ORAL TEST AND IT IS CONSIDERED PASSED WITH THE ACHIEVEMENT OF THE PRE-ESTABLISHED MINIMUM SCORE. WRITTEN TESTS WILL BE SPECIALLY DESIGNED TO VERIFY THE ACQUISITION BY THE STUDENT OF THE ABILITY TO APPLY ALGORITHMIC DESIGN AND ANALYSIS METHODOLOGIES TO SIMPLE CONCRETE PROBLEMS. THE ORAL TEST CONSISTS OF QUESTIONS AND DISCUSSION ON THE METHODOLOGIES STUDIED DURING THE COURSE. IT IS MAINLY INTENDED TO ASSESS THE LEVEL OF KNOWLEDGE AND UNDERSTANDING REACHED BY THE STUDENT. AS A RULE, THE FINAL GRADE IS THE ARITHMETIC AVERAGE OF THE WRITTEN AND ORAL TESTS EVALUATIONS.
Texts
TEXTBOOKS:
KLEINBERG, TARDOS. ALGORITHM DESIGN. PEARSON ADDISON WESLEY.
S. DASGUPTA, C.H. PAPADIMITRIOU, AND U.V. VAZIRANI. ALGORITHMS. MCGRAW-HILL

ADDITIONAL TEACHING MATERIAL (EXERCISES, TESTS FOR SELF-ASSESSMENT) WILL BE MADE AVAILABLE THROUGH THE TEACHERS PERSONAL WEB SITES).