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

Definition of lesson periods
Period From To
Semester 1 Oct 3, 2022 Jan 27, 2023
Semester 2 Mar 6, 2023 Jun 16, 2023
Exam sessions
Session From To
Sessione invernale d'esame Jan 30, 2023 Mar 3, 2023
Sessione estiva d'esame Jun 19, 2023 Jul 31, 2023
Sessione autunnale d'esame Sep 4, 2023 Sep 29, 2023
Degree sessions
Session From To
Sessione Estiva Jul 18, 2023 Jul 18, 2023
Sessione Autunnale Oct 13, 2023 Oct 13, 2023
Sessione Invernale Mar 13, 2024 Mar 13, 2024
Holidays
Period From To
Ponte Festa di tutti i Santi Oct 31, 2022 Nov 1, 2022
Ponte dell'Immacolata Concezione Dec 8, 2022 Dec 9, 2022
Vacanze natalizie Dec 23, 2022 Jan 8, 2023
Vacanze di Pasqua Apr 7, 2023 Apr 10, 2023
Festa della Liberazione Apr 24, 2023 Apr 25, 2023
Festa del lavoro May 1, 2023 May 1, 2023
Festa del Santo Patrono May 21, 2023 May 21, 2023
Festa della Repubblica Jun 2, 2023 Jun 2, 2023
Chiusura estiva Aug 14, 2023 Aug 19, 2023

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 Enrollment FAQs

Academic staff

B C D F G M O P Q R S T

Belussi Alberto

symbol email alberto.belussi@univr.it symbol phone-number +39 045 802 7980

Bombieri Nicola

symbol email nicola.bombieri@univr.it symbol phone-number +39 045 802 7094

Bonacina Maria Paola

symbol email mariapaola.bonacina@univr.it symbol phone-number +39 045 802 7046

Carra Damiano

symbol email damiano.carra@univr.it symbol phone-number +39 045 802 7059

Castellani Umberto

symbol email umberto.castellani@univr.it symbol phone-number +39 045 802 7988

Ceccato Mariano

symbol email mariano.ceccato@univr.it

Cicalese Ferdinando

symbol email ferdinando.cicalese@univr.it symbol phone-number +39 045 802 7969

Combi Carlo

symbol email carlo.combi@univr.it symbol phone-number +390458027985

Cristani Matteo

symbol email matteo.cristani@univr.it symbol phone-number 045 802 7983

Cristani Marco

symbol email marco.cristani@univr.it symbol phone-number +39 045 802 7841

Cubico Serena

symbol email serena.cubico@univr.it symbol phone-number 045 802 8132

Dalla Preda Mila

symbol email mila.dallapreda@univr.it

Farinelli Alessandro

symbol email alessandro.farinelli@univr.it symbol phone-number +39 045 802 7842

Fiorini Paolo

symbol email paolo.fiorini@univr.it symbol phone-number 045 802 7963

Fummi Franco

symbol email franco.fummi@univr.it symbol phone-number 045 802 7994

Giacobazzi Roberto

symbol email roberto.giacobazzi@univr.it symbol phone-number +39 045 802 7995

Maris Bogdan Mihai

symbol email bogdan.maris@univr.it symbol phone-number +39 045 802 7074

Masini Andrea

symbol email andrea.masini@univr.it symbol phone-number 045 802 7922

Mastroeni Isabella

symbol email isabella.mastroeni@univr.it symbol phone-number +390458027089

Meli Daniele

symbol email daniele.meli@univr.it symbol phone-number 7908

Menegaz Gloria

symbol email gloria.menegaz@univr.it symbol phone-number +39 045 802 7024

Merro Massimo

symbol email massimo.merro@univr.it symbol phone-number 045 802 7992

Oliboni Barbara

symbol email barbara.oliboni@univr.it symbol phone-number +39 045 802 7077

Paci Federica Maria Francesca

symbol email federicamariafrancesca.paci@univr.it symbol phone-number +39 045 802 7909

Pianezzi Daniela

symbol email daniela.pianezzi@univr.it

Posenato Roberto

symbol email roberto.posenato@univr.it symbol phone-number +39 045 802 7967

Quaglia Davide

symbol email davide.quaglia@univr.it symbol phone-number +39 045 802 7811

Rizzi Romeo

symbol email romeo.rizzi@univr.it symbol phone-number +39 045 8027088

Sala Pietro

symbol email pietro.sala@univr.it symbol phone-number 0458027850

Segala Roberto

symbol email roberto.segala@univr.it symbol phone-number 045 802 7997

Tomazzoli Claudio

symbol email claudio.tomazzoli@univr.it

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.

CURRICULUM TIPO:

1° Year 

2° Year   activated in the A.Y. 2023/2024

ModulesCreditsTAFSSD
Final exam
24
E
-
activated in the A.Y. 2023/2024
ModulesCreditsTAFSSD
Final exam
24
E
-
Modules Credits TAF SSD
Between the years: 1°- 2°
Between the years: 1°- 2°
Between the years: 1°- 2°
English B2
3
F
-
Between the years: 1°- 2°
Between the years: 1°- 2°
Further activities
3
F
-

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

Type D and Type F activities

Le attività formative di tipologia D sono a scelta dello studente, quelle di tipologia F sono ulteriori conoscenze utili all’inserimento nel mondo del lavoro (tirocini, competenze trasversali, project works, ecc.). In base al Regolamento Didattico del Corso, alcune attività possono essere scelte e inserite autonomamente a libretto, altre devono essere approvate da apposita commissione per verificarne la coerenza con il piano di studio. Le attività formative di tipologia D o F possono essere ricoperte dalle seguenti attività.

1. Insegnamenti impartiti presso l'Università di Verona

Comprendono gli insegnamenti sotto riportati e/o nel Catalogo degli insegnamenti (che può essere filtrato anche per lingua di erogazione tramite la Ricerca avanzata).

Modalità di inserimento a libretto: se l'insegnamento è compreso tra quelli sottoelencati, lo studente può inserirlo autonomamente durante il periodo in cui il piano di studi è aperto; in caso contrario, lo studente deve fare richiesta alla Segreteria, inviando a carriere.scienze@ateneo.univr.it il modulo nel periodo indicato.

2. Attestato o equipollenza linguistica CLA

Oltre a quelle richieste dal piano di studi, per gli immatricolati dall'A.A. 2021/2022 vengono riconosciute:

  • Lingua inglese: vengono riconosciuti 3 CFU per ogni livello di competenza superiore a quello richiesto dal corso di studio (se non già riconosciuto nel ciclo di studi precedente).
  • Altre lingue e italiano per stranieri: vengono riconosciuti 3 CFU per ogni livello di competenza a partire da A2 (se non già riconosciuto nel ciclo di studi precedente).

Tali cfu saranno riconosciuti, fino ad un massimo di 6 cfu complessivi, di tipologia F se il piano didattico lo consente, oppure di tipologia D. Ulteriori crediti a scelta per conoscenze linguistiche potranno essere riconosciuti solo se coerenti con il progetto formativo dello studente e se adeguatamente motivati.

Gli immatricolati fino all'A.A. 2020/2021 devono consultare le informazioni che si trovano qui.

Modalità di inserimento a librettorichiedere l’attestato o l'equipollenza al CLA e inviarlo alla Segreteria Studenti - Carriere per l’inserimento dell’esame in carriera, tramite mail: carriere.scienze@ateneo.univr.it

3. Competenze trasversali

Scopri i percorsi formativi promossi dal TALC - Teaching and learning center dell'Ateneo, destinati agli studenti regolarmente iscritti all'anno accademico di erogazione del corso https://talc.univr.it/it/competenze-trasversali

Modalità di inserimento a libretto: non è previsto l'inserimento dell'insegnamento nel piano di studi. Solo in seguito all'ottenimento dell'Open Badge verranno automaticamente convalidati i CFU a libretto. La registrazione dei CFU in carriera non è istantanea, ma ci saranno da attendere dei tempi tecnici.  

4. CONTAMINATION LAB

Il Contamination Lab Verona (CLab Verona) è un percorso esperienziale con moduli dedicati all'innovazione e alla cultura d'impresa che offre la possibilità di lavorare in team con studenti e studentesse di tutti i corsi di studio per risolvere sfide lanciate da aziende ed enti. Il percorso permette di ricevere 6 CFU in ambito D o F. Scopri le sfide: https://www.univr.it/clabverona

ATTENZIONE: Per essere ammessi a sostenere una qualsiasi attività didattica, incluse quelle a scelta, è necessario essere iscritti all'anno di corso in cui essa viene offerta. Si raccomanda, pertanto, ai laureandi delle sessioni di dicembre e aprile di NON svolgere attività extracurriculari del nuovo anno accademico, cui loro non risultano iscritti, essendo tali sessioni di laurea con validità riferita all'anno accademico precedente. Quindi, per attività svolte in un anno accademico cui non si è iscritti, non si potrà dar luogo a riconoscimento di CFU.

5. Periodo di stage/tirocinio

Oltre ai CFU previsti dal piano di studi (verificare attentamente quanto indicato sul Regolamento Didattico): qui informazioni su come attivare lo stage. 

Verificare nel regolamento quali attività possono essere di tipologia D e quali di tipologia F.

Insegnamenti e altre attività che si possono inserire autonomamente a libretto

 

Semester 1 From 10/3/22 To 1/27/23
years Modules TAF Teacher
1° 2° Introduction to Robotics for students of scientific courses. D Paolo Fiorini (Coordinator)
1° 2° Matlab-Simulink programming D Bogdan Mihai Maris (Coordinator)
1° 2° Rapid prototyping on Arduino D Franco Fummi (Coordinator)
1° 2° Programming Challanges D Romeo Rizzi (Coordinator)
Semester 2 From 3/6/23 To 6/16/23
years Modules TAF Teacher
1° 2° Introduction to 3D printing D Franco Fummi (Coordinator)
1° 2° Python programming language D Carlo Combi (Coordinator)
1° 2° HW components design on FPGA D Franco Fummi (Coordinator)
1° 2° Protection of intangible assets (SW and invention)between industrial law and copyright D Roberto Giacobazzi (Coordinator)
List of courses with unassigned period
years Modules TAF Teacher
1° 2° Federated learning from zero to hero D Gloria Menegaz

Teaching code

4S008896

Credits

12

Coordinator

Romeo Rizzi

Language

Italian

Scientific Disciplinary Sector (SSD)

ING-INF/05 - INFORMATION PROCESSING SYSTEMS

The teaching is organized as follows:

Teoria

Credits

10

Period

Semester 2

Laboratorio

Credits

2

Period

Semester 2

Academic staff

Romeo Rizzi

Learning objectives

The overall targets of the course is to expose some aspects of the deep and important dialectic exchange between the search for algorithmic solutions and the study of the complexity of problems. Algorithms are the backbone and the substance of information technologies, but at the same time their study goes beyond the "mere" computer science and is pervasive to all the disciplines that are problem-bearers. The design of an algorithm starts from the study of the structure of the problem to be solved and it usually represents the highest achievement of this process. The study of algorithms requires and offers methodologies and techniques of problem solving, logical and mathematical skills. The course therefore aims to provide students with fundamental skills and methodologies for the analysis of problems and the design of the algorithms for solving them. Particular emphasis is given to the efficiency of the algorithms themselves, and the theory of computational complexity plays a profound methodological role in the analysis of problems. With reference to the overall didactic aims of the Master program, the course leads students to deepen and expand the three-year training in the field of analysis and evaluation of problems, algorithms, and computational models, providing a wealth of advanced tools to address non-trivial problems in different IT fields. The students will acquire logical-mathematical skills, techniques, experience and methodologies useful in the analysis of algorithmic problems, from detecting their structure and analyzing their computational complexity to designing efficient algorithms, and then planning and conducting their implementation. Besides that, The course provides the foundations of computational complexity theory, focussing on: the theory of NP-completeness; approximation algorithms and basic approaches for the analysis of the approximation guarantee of algorithms for hard problems; and parameterized approaches to hard problems. The student will apply the main algorithmic techniques: recursion, divide and conquer, dynamic programming, some data structures, invariants and monovariants. The student will develop sensitivity about which problems can be solved efficiently and with which techniques, acquiring also dialectical tools to place the complexity of an algorithmic problem and identify promising approaches for the same, looking at the problem to grasp its structure. She will learn to produce, discuss, evaluate, and validate conjectures, and also independently tackle the complete path from the analysis of the problem, to the design of a resolver algorithm, to the coding and experimentation of the same, even in research contexts either in the private sector or at research institutions. Based on the basic notions acquired of computational complexity, the students will be able to employ reductions, standard techniques in complexity theory, to analyze the structural properties of computational problems and identify possible alternative approaches (approximation, parameterization) in the absence of (provably) efficient solutions After attending the course the students will be able to: classify intractable computational problems; understand and verify a formal proof; read and understand a scientific article where a new algorithm is presented together with the analysis of its computational complexity.

Prerequisites and basic notions

know how to program in some programming language.

Program

The Yin and the Yang of problem solving are the general methods for the solutions of instances of the problem (the Algorithms) on one side, and a detached aesthetic eye on the richness of the problem (Complexity) on the other. Two passionate enthusiasts will guide you in the exploration of these two synergistic arts with the hope that in you they might merge into just one.
ALGORITHMS SIDE:
1. The workflow of problem solving: analysis and comprehension of the problem, conception of an algorithmic solution, design of an efficient algorithm, planning the implementation, conducting the implementation, testing and debugging.
2. Methodology in analyzing a problem:
The study of special cases. Particularization and generalization.
Building a dialog with the problem. Conjectures. Simplicity assumptions.
Solving a problem by reducing it to another. Reductions among problems to organize them into classes. Reducing problems to isolate the most fundamental questions. The role of complexity theory in classifying problems into classes. The role of complexity theory in analyzing problems. Counterexamples and NP-hardness proofs. Good conjectures and good characterizations. The belief can make conjectures true. Decomposing problems and inductive thinking.
3. Algorithm design general techniques.
Recursion. Divide et impera. Recursion with memoization. Dynamic programming (DP). Greedy.
DP on sequences. DP on DAGs. More in depth: good characterization of DAGs and scheduling, composing partial orders into new ones.
DP on trees. More in depth: adoption of the children one by one; advantages of an edge-centric vision over the node-centric one.
The asymptotic eye on worst case performance guides the design of algorithms:
the binary search example; negligible improvements; amortized analysis.
Some data structures: binary heaps; prefix-sums; Fenwick trees; range trees.
4. Algorithms on graphs and digraphs.
Bipartite graphs: recognition algorithms and good characterizations.
Eulerian graphs: recognition algorithms and good characterizations.
Shortest paths. Minimum spanning trees.
Maximum flows and minimum cuts.
Bipartite matchings and node covers.
The kernel of a DAG. Progressively finite games. Sums of games.
5. General hints on implementing, coding, testing and debugging.
Plan your implementation. Anticipate the important decisions, and realize where the obscure points are. Try to go round the most painful issues you foresee. Code step by step. Verify step by step. Use the assert. Testing and debugging techniques. Self-certifying algorithms.
COMPLEXITY SIDE:
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.
Space Complexity. Models and fundamental difference between the use of time resource and the space resource. Completeness for space complexity classes. 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.
Examples of simple randomised algorithms in solving hard problems. . Examples of parameterized approaches to solve hard problems.

Bibliography

Visualizza la bibliografia con Leganto, strumento che il Sistema Bibliotecario mette a disposizione per recuperare i testi in programma d'esame in modo semplice e innovativo.

Didactic methods

in presence. The lessons will still be recorded and where convenient and upon request we could also serve those who need to follow remotely.

Learning assessment procedures

A written test which mainly focuses on Complexity topics and a laboratory test which mainly focuses on Algorithmic topics contribute to the vote in equal measure.
The writing is based on the path taken in class. For some examples of exercises, please refer to the reference repository for the written test:
https://github.com/romeorizzi/prove_scrive_AlgoComp
In the computer laboratory, students have to take a 5-hour test where they are assigned problems.
Students must analyze and understand the problems and their structure, identify algorithmic solutions for them, and implement these solutions in c/c++ or Pascal code. The more efficient this turns out to be, the more points you collect.
During the exam, students can gradually submit what they have produced to a site completely similar to the one used during the exercises in the laboratory and/or at home. In this way they can obtain an immediate and contextual evaluation that can guide them in conducting the test.
The solutions are evaluated based on the subtasks of the exercise that they manage to solve correctly without exceeding the time and memory resources predetermined by the exercise.
Find problems and reference materials for the laboratory test at the following repositories and platforms where you can try your hand at the exercises:
https://github.com/romeorizzi/esami-algo-public
https://rizzi.olinfo.it/algo-simula-prove
https://cms.di.unipi.it/algo/
The problems proposed there constitute the primary resource for preparing for the exam. The submission system you will use for the exam is TALight.
Even after obtaining a positive grade, the student can participate in multiple exams to see if he can improve it: the policy is to keep the best grade on the various exams, but there are also mechanisms by which the grades are added together.
You will find your grades portfolio on the course website:
http://profs.sci.univr.it/~rrizzi/classes/Algoritmi/index.html

Students with disabilities or specific learning disorders (SLD), who intend to request the adaptation of the exam, must follow the instructions given HERE

Evaluation criteria

The various parts of the exam and grade management are characterized by maximum transparency.

Criteria for the composition of the final grade

When the student has, in his/her grade portfolio, both a positive grade (at least 18) for the Complexity module and a positive grade (at least 18) for the Algorithms module, he/she can ask the teacher in charge of the course to proceed with the recording of the grade for the entire course, obtained as the average of the grades for the two modules.
The average is rounded up and a 30 with honors is worth 33. To generate a 30 with honors as the final grade you need at least one honors and neither of the two evaluations below 30.
When you think the time has come to register your vote, send an email to romeo.rizzi@univr.it specifying:
1. your personal details (registration number VRxxxxxx);
2. vote you expect to be recorded;
3. vote for the algorithms part, specifying how it is composed (specifying the reference calls);
4. last complexity exam you submitted, with the grade obtained.
The ways to request registration and the entire workflow are shown on the page:
http://profs.sci.univr.it/~rrizzi/classes/Algoritmi/index.html
On the same page you will also find the portfolio of your votes, as well as information on how the vote for the Algorithms module is produced and managed.

Exam language

Italian. But, under request, we will prepare also an English text.

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

theses proposals Research area
Analisi ed identificazione automatica del tono/volume della voce AI, Robotics & Automatic Control - AI, Robotics & Automatic Control
Analisi e percezione dei segnali biometrici per l'interazione con robot AI, Robotics & Automatic Control - AI, Robotics & Automatic Control
Integrazione del simulatore del robot Nao con Oculus Rift AI, Robotics & Automatic Control - AI, Robotics & Automatic Control
BS or MS theses in automated reasoning Computing Methodologies - ARTIFICIAL INTELLIGENCE
Sviluppo sistemi di scansione 3D Computing Methodologies - COMPUTER GRAPHICS
Sviluppo sistemi di scansione 3D Computing Methodologies - IMAGE PROCESSING AND COMPUTER VISION
Dati geografici Information Systems - INFORMATION SYSTEMS APPLICATIONS
Analisi ed identificazione automatica del tono/volume della voce Robotics - Robotics
Analisi e percezione dei segnali biometrici per l'interazione con robot Robotics - Robotics
Integrazione del simulatore del robot Nao con Oculus Rift Robotics - Robotics
BS or MS theses in automated reasoning Theory of computation - Logic
BS or MS theses in automated reasoning Theory of computation - Semantics and reasoning
Proposte di tesi/collaborazione/stage in Intelligenza Artificiale Applicata Various topics
Proposte di Tesi/Stage/Progetto nell'ambito dell'analisi dei dati Various topics

Attendance

As stated in the Teaching Regulations for the A.Y. 2022/2023, attendance at the course of study is not mandatory.
 


Career management


Student login and resources


Erasmus+ and other experiences abroad