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.

Academic calendar

Course calendar

The Academic Calendar sets out the degree programme lecture and exam timetables, as well as the relevant university closure dates..

Academic year:
Definition of lesson periods
Period From To
1° Q - 2° anno e successivi Sep 27, 2004 Nov 26, 2004
2° Q Jan 10, 2005 Mar 11, 2005
3° Q Apr 11, 2005 Jun 10, 2005
Exam sessions
Session From To
1st exam session Dec 6, 2004 Dec 17, 2004
2nd exam session Mar 21, 2005 Apr 8, 2005
Summer term Jun 20, 2005 Jul 15, 2005
Autumn term Sep 5, 2005 Sep 30, 2005
Degree sessions
Session From To
Extra term Dec 15, 2004 Dec 15, 2004
Winter term Mar 15, 2005 Mar 15, 2005
Summer term Jul 20, 2005 Jul 20, 2005
Autumn term Sep 21, 2005 Sep 21, 2005
Period From To
All Saints Day Nov 1, 2004 Nov 1, 2004
Immaculate Conception Day Dec 8, 2004 Dec 8, 2004
Christmas holidays Dec 22, 2004 Jan 6, 2005
Easter holidays Mar 24, 2005 Mar 29, 2005
Labour Day May 1, 2005 May 1, 2005
Patron Saint's Day S. Zeno May 21, 2005 May 21, 2005
The Day of the Republic Jun 2, 2005 Jun 2, 2005
Summer holidays Jul 25, 2005 Aug 31, 2005

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.

Exam calendar

Should you have any doubts or questions, please check the Enrolment FAQs

Academic staff


Acquaviva Andrea +39 045 802 7059

Bellin Gianluigi +39 045 802 7969

Bonacina Maria Paola +39 045 802 7046

Combi Carlo 045 802 7985

Cristani Matteo 045 802 7983

Di Pierro Alessandra +39 045 802 7971

Fummi Franco 045 802 7994

Giacobazzi Roberto +39 045 802 7995

Gregorio Enrico 045 802 7937

Manca Vincenzo 045 802 7981

Masini Andrea 045 802 7922

Mastroeni Isabella +39 045 802 7089

Merro Massimo 045 802 7992

Monti Francesca 045 802 7910

Morato Laura Maria 045 802 7904

Posenato Roberto +39 045 802 7967

Pravadelli Graziano +39 045 802 7081

Segala Roberto 045 802 7997

Solitro Ugo +39 045 802 7977
Marco Squassina,  January 5, 2014

Squassina Marco +39 045 802 7913

Vigano' Luca

Villa Tiziano +39 045 802 7034

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 enrolment year.

Attività tipo F (laurea specialistica)
Prova finale (laurea specialistica)

1° Year


2° Year


3° Year


4° Year


5° Year

Attività tipo F (laurea specialistica)
Prova finale (laurea specialistica)
Modules Credits TAF SSD
Between the years: 4°- 5°Due insegnamenti affini a scelta per un totale di 10 crediti:

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.

S Placements in companies, public or private institutions and professional associations

Teaching code






Scientific Disciplinary Sector (SSD)



3° Q dal Apr 7, 2008 al Jun 13, 2008.

Learning outcomes

The goal of this course is to introduce some advanced paradigms for algorithms development and analysis in order to solve optimization problems.


Main concepts recall about computational problems: definition, instances, encoding, precise and approximate models. Optimization computational problem.

Main concepts recall about algorithms: computational resources, input encoding, input size/cost, computational time. Worst and average analysis. Computational time and growth order.

Computational time vs. hardware improvements: main relations. Efficient algorithms and tractable problems.

Divide et impera paradigm
Definition and application to some problems.

Greedy paradigm
Definition and application to some problems. Matroids and greedy algorithms.

Backtracking technique
Definition and application to some problems.

Branch & Bound technique
Definition and application to some problems.

Dynamic programming paradigm
Definition and application to some problems.
Memoization and Dynamic programming.

Local search tecnique
Definition and application to some problems.

Approximations algorithms
Definition and some application examples.
Simulated annealing.
Tabù search.

Probabilistic algorithms
Definition and few application examples.
Numerical probabilistic algorithms, Monte Carlo algorithms and Las Vegas algorithms. Examples: Buffon's needle, Pattern Matching and Universal hashing.

Reference texts
Author Title Publishing house Year ISBN Notes
Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani Algorithms (Edizione 1) McGraw-Hill Higher Education 2007 978-0-07-352340-8
Alan Bertossi Algoritmi e strutture dati (Edizione 1) UTET 2000 88-7750-611-3
G. Brassard, P. Bratley Fundamentals of Algorithms Prentice-Hall 1996 0133350681
R. C. T. Lee, S. S. Tseng, R. C. Chang, Y. T. Tsai Introduction to the Design and Analysis of Algorithms (Edizione 1) McGraw-Hill Education 2005 007-124346-1
T. Cormen, C. Leiserson, R. Rivest, C. Stein Introduzione agli Algoritmi e Strutture Dati (Edizione 2) McGraw-Hill 2005 88-386-6251-7

Examination Methods

The final exam consists of a written part followed, if it is sufficient, by an oral part.

Teaching materials

Type D and Type F activities

Academic year:

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.

Further services

I servizi e le attività di orientamento sono pensati per fornire alle future matricole gli strumenti e le informazioni che consentano loro di compiere una scelta consapevole del corso di studi universitario.