ALGORITHM DESIGN

Computer science ALGORITHM DESIGN

0512100043
COMPUTER SCIENCE
EQF6
COMPUTER SCIENCE
2021/2022

OBBLIGATORIO
YEAR OF COURSE 2
YEAR OF DIDACTIC SYSTEM 2017
SECONDO SEMESTRE
CFUHOURSACTIVITY
648LESSONS
324LAB


Objectives

SKILL TO APPLY KNOWLEDGE AND COMPREHENSION

THE COURSE HAS THE FOLLOWING OBJECTIVES:
- PROVIDE THE STUDENT WITH METHODS AND KNOWLEDGE SUITABLE FOR THE DESIGN OF EFFICIENT ALGORITHMS
- PROVIDE TOOLS FOR THE ANALYSIS OF RESOURCES (SPACE AND TIME) USED BY ALGORITHMS
- PROVIDE A CATALOGUE OF THE MOST WELL-KNOWN AND EFFICIENT ALGORITHMS FOR BASIC COMPUTATIONAL PROBLEMS (SORTING, SEARCHING, RESOURCE OPTIMIZATION, ETC.)

KNOWLEDGE AND COMPREHENSION SKILLS
THE GOAL OF THE CLASS IS TO HELP THE STUDENTS IN DEVELOPING THE SKILL TO TRANSLATE REAL-WORLD PROBLEMS INTO ABSTRACT MODELS AND COMPUTATIONAL PROBLEMS, AND TO DESIGN EFFICIENT ALGORITHMIC SOLUTIONS.
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: (48 THEORY, 24 EXERCITATIONS)

1. INTRODUCTION TO THE ASYMPTOTIC NOTATIONS BIGOH, OMEGA, THETA AND THEIR APPLICATIONS TO THE ANALYSIS OF ALGORITHMS.
2. RECURRENCE RELATIONS FOR THE ANALYSIS OF RECURSIVE ALGORITHMS, AND METHODS FOR THEIR SOLUTIONS.
3. THE DIVIDE ET CONQUER TECHNIQUE FOR THE DESIGN OF ALGORITHMS, AND EXAMPLES OF APPLICATIONS.
4. THE DINAMIC PROGRAMMING TECHNIQUE FOR THE DESIGN OF ALGORITHMS, AND EXAMPLES OF APPLICATIONS.
5. THE GREEDY TECHNIQUE FOR THE DESIGN OF ALGORITHMS, AND EXAMPLES OF APPLICATIONS.
6. GRAPHS AND GRAPHS ALGORITHMS. BREADTH FIRST AND DEPTH FIRST SEARCH ON GRAPHS AND THEIR APPLICATIONS. DIRECTED ACYCLIC GRAPHS AND
TOPOLOGICAL SORTING. MINIMUM COST PATHS IN EDGE-WEIGHTED GRAPHS AND ALGORITHMS FOR THEIR COMPUTATION. MINIMUM COST SPANNING TREES IN EDGE-WEIGHTED GRAPHS
AND ALGORITHMS FOR THEIR COMPUTATION.
7. INTELLIGENT EXHAUSTIVE SEARCH: BACKTRACKING, BRANCH-AND- BOUND AND EXAMPLES OF APPLICATIONS.
Teaching Methods
THIS CLASS INCLUDES THEORETICAL LECTURES (48 HOURS) WITH THE GOAL OF LEARNING THE BASIC TECHNIQUES FOR THE DESIGN AND ANALYSIS OF ALGORITHMS, AND EXCERCISES-BASED LECTURES (24 HOURS), 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.
STUDENTS ARE ADVISED TO ATTEND CLASSES THOUGH THEY ARE NOT OBLIGED TO.
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 MAY BE REPLACED BY A MIDTERM EXAM AND A FINAL. THE WRITTEN TEST TIME RANGES FROM 90 TO 120 MINUTES. IT 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:
1. KLEINBERG, TARDOS. ALGORITHM DESIGN. PEARSON ADDISON WESLEY.
2. S. DASGUPTA, C.H. PAPADIMITRIOU, AND U.V. VAZIRANI. ALGORITHMS. MCGRAW-HILL
FURTHER COURSE MATERIAL ALONG WITH THE NECESSARY SUPPORT TO STUDY AND TO PREPARE FOR THE EXAM ARE PROVIDED THROUGH THE LECTURERS' WEB PAGES AND THROUGH THE E-LEARNING PLATFORM AT THE FOLLOWING URL HTTP://ELEARNING.INFORMATICA.UNISA.IT/ .
More Information
IT IS REASONABLE TO ASSUME THAT AN AVERAGE OF TWO HOURS OF INDIVIDUAL STUDY ARE REQUIRED FOR EACH HOUR OF CLASS LESSON.
  BETA VERSION Data source ESSE3 [Ultima Sincronizzazione: 2022-07-21]