Studying at the University of Verona
Here you can find information on the organisational aspects of the Programme, lecture timetables, learning activities and useful contact details for your time at the University, from enrolment to graduation.
Academic calendar
The academic calendar shows the deadlines and scheduled events that are relevant to students, teaching and technical-administrative staff of the University. Public holidays and University closures are also indicated. The academic year normally begins on 1 October each year and ends on 30 September of the following year.
Course calendar
The Academic Calendar sets out the degree programme lecture and exam timetables, as well as the relevant university closure dates..
Period | From | To |
---|---|---|
I semestre | Oct 1, 2015 | Jan 29, 2016 |
II semestre | Mar 1, 2016 | Jun 10, 2016 |
Session | From | To |
---|---|---|
Sessione straordinaria Appelli d'esame | Feb 1, 2016 | Feb 29, 2016 |
Sessione estiva Appelli d'esame | Jun 13, 2016 | Jul 29, 2016 |
Sessione autunnale Appelli d'esame | Sep 1, 2016 | Sep 30, 2016 |
Session | From | To |
---|---|---|
Sess. autun. App. di Laurea LM18-32 | Oct 21, 2015 | Oct 21, 2015 |
Sess. invern. App. di Laurea LM18-32 | Mar 17, 2016 | Mar 17, 2016 |
Sess. estiva App. di Laurea LM18-32 | Jul 13, 2016 | Jul 13, 2016 |
Sess. autun 2016 App. di Laurea LM18-32 | Oct 19, 2016 | Oct 19, 2016 |
Sess. invern. 2017 App. di Laurea-LM18-32 | Mar 21, 2017 | Mar 21, 2017 |
Period | From | To |
---|---|---|
Festività dell'Immacolata Concezione | Dec 8, 2015 | Dec 8, 2015 |
Vacanze di Natale | Dec 23, 2015 | Jan 6, 2016 |
Vancanze di Pasqua | Mar 24, 2016 | Mar 29, 2016 |
Anniversario della Liberazione | Apr 25, 2016 | Apr 25, 2016 |
Festa del S. Patrono S. Zeno | May 21, 2016 | May 21, 2016 |
Festa della Repubblica | Jun 2, 2016 | Jun 2, 2016 |
Vacanze estive | Aug 8, 2016 | Aug 15, 2016 |
Exam calendar
Exam dates and rounds are managed by the relevant Science and Engineering Teaching and Student Services Unit.
To view all the exam sessions available, please use the Exam dashboard on ESSE3.
If you forgot your login details or have problems logging in, please contact the relevant IT HelpDesk, or check the login details recovery web page.
Should you have any doubts or questions, please check the Enrollment FAQs
Academic staff
Study Plan
The Study Plan includes all modules, teaching and learning activities that each student will need to undertake during their time at the University.
Please select your Study Plan based on your enrollment year.
1° Year
Modules | Credits | TAF | SSD |
---|
2° Year activated in the A.Y. 2016/2017
Modules | Credits | TAF | SSD |
---|
Modules | Credits | TAF | SSD |
---|
Modules | Credits | TAF | SSD |
---|
Modules | Credits | TAF | SSD |
---|
Legend | Type of training activity (TTA)
TAF (Type of Educational Activity) All courses and activities are classified into different types of educational activities, indicated by a letter.
Algorithms - COMPLESSITÀ (2015/2016)
Teaching code
4S02709
Teacher
Credits
6
Language
Italian
Scientific Disciplinary Sector (SSD)
ING-INF/05 - INFORMATION PROCESSING SYSTEMS
Period
II semestre dal Mar 1, 2016 al Jun 10, 2016.
Location
VERONA
To show the organization of the course that includes this module, follow this link: Course organization
Learning outcomes
The goal of this module is to introduce students to the main aspects of the computational complexity theory, and, in particular, to the NP-completeness theory and to the computational analysis of problems with respect to their approximability.
Recommended Prerequisites
-------------------------
To attend the course in a productive way, a student should be confident with the following topics:
1. Basic data structures as list, stack, queue, tree, heap.
2. Graph representation and fundamental graph algorithms:
2.1 Graph visit: BFS, DFS.
2.2 Topological ordering. Connected component.
2.3 Minimal spanning tree. Kruskal and Prim algorithm.
2.4 Single-source shortest path: Dijkstra algorithm and Bellman-Ford one.
2.5 All-pairs shortest path: Floyd-Warshall algorithm and Johnson one.
2.6 Max flow: Ford-Fulkerson algorithm.
A recommended book to revise the above topics is ``Introduction to Algorithms" di T. H. Cormen, C. E. Leiserson, R. L. Rivest e C. Stein (3 ed.).
Program
Computational models, computational resources, efficient algorithms and tractable problems.
Relationships among computational problems. Polynomial reductions of one problem into another. The classes P, NP, co-NP. Notion of completeness. Proofs od NP-completeness: Cook's theorem; proofs of completeness using appropriate reductions. Search and Decision Problems. Self-Reducibility of NP-complete problems and existence of non-selfreducible problems. Recap of basic notions of computability: Turing Machines and Diagonalization. Hierarchy theorems for time complexity classes. Separability of classes and the existence of intermediate problem under the hypothesis the P is not equal NP.
Space Complexity. Models and fundamental difference between the use of time resource and the space resource. The space complexity classes NL and L and their relationship with the time complexity class P. The centrality of the reachability problem for the study of space complexity. Completeness for space complexity classes: Log-space reductions; NL-completeness of reachability. Non-determinism and space complexity. Savitch theorem and Immelmann-Szelepcsenyi theorem. The classes PSPACE and NPSPACE. Examples of reductions to prove PSPACE-completeness.
Introduction to the approximation algorithms for optimisation problems. Examples of approximation algorithms. Classification of problems with respect to their approximabuility. The classes APX, PTAS, FPTAS. Notion of inapproximability; the gap technique to prove inapproximability results; examples of approximation preserving reductions.
Introduction to the use of randomisation for solving hard problems. Classification of problems with respect to their solvability by means of polynomial randomized algorithms. The classes RP, ZPP, BPP and their relationships. Example of relationships between randomized complexity classes and the classes in the polynomial hierarchy.
Examination Methods
The examination consists of a written test. The grade in this module is worth 1/2 of the grade in the Algorithms examination.
Type D and Type F activities
Documents and news
- PIANO DIDATTICO LM-18 LM-32 (octet-stream, it, 18 KB, 21/09/18)
Modules not yet included
Career prospects
Module/Programme news
News for students
There you will find information, resources and services useful during your time at the University (Student’s exam record, your study plan on ESSE3, Distance Learning courses, university email account, office forms, administrative procedures, etc.). You can log into MyUnivr with your GIA login details: only in this way will you be able to receive notification of all the notices from your teachers and your secretariat via email and soon also via the Univr app.
Graduation
Deadlines and administrative fulfilments
For deadlines, administrative fulfilments and notices on graduation sessions, please refer to the Graduation Sessions - Science and Engineering service.
Need to activate a thesis internship
For thesis-related internships, it is not always necessary to activate an internship through the Internship Office. For further information, please consult the dedicated document, which can be found in the 'Documents' section of the Internships and work orientation - Science e Engineering service.
Final examination regulations
List of theses and work experience proposals
Attendance
As stated in the Teaching Regulations for the A.Y. 2022/2023, attendance at the course of study is not mandatory.