ALGORITHMIC THINKING AND COMPUTATIONAL COMPLEXITY
ALGORITHMIC THINKING AND COMPUTATIONAL COMPLEXITY
| A.Y. | Credits |
|---|---|
| 2021/2022 | 4 |
| Lecturer | Office hours for students | |
|---|---|---|
| Valerio Freschi |
| Teaching in foreign languages |
|---|
|
Course entirely taught in a foreign language
English
This course is entirely taught in a foreign language and the final exam can be taken in the foreign language. |
Assigned to the Degree Course
| Date | Time | Classroom / Location |
|---|
| Date | Time | Classroom / Location |
|---|
Learning Objectives
The aim of the course is to provide basic elements of algorithmic thinking, algorithms analysis, and computational complexity.
Program
01. Introduction to algorithms:
01.01 Algorithms classification
01.02 Correctness of an algorithm with respect to a problem
01.03 Complexity of an algorithm with respect to resource usage
01.04 Data structures and their typologies
01.05 Algorithms performance: empirical and mathematical analysis
01.06 Asymptotic complexity of algorithms
02. Classes of problems:
02.01 Decidable and undecidable problems
02.02 Tractable and intractable problems
02.03 Cook theorem
02.04 NP-completeness
Teaching Material
The teaching material prepared by the lecturer in addition to recommended textbooks (such as for instance slides, lecture notes, exercises, bibliography) and communications from the lecturer specific to the course can be found inside the Moodle platform › blended.uniurb.it
| « back | Last update: 28/01/2022 |
