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.

A.A. 2016/2017

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
I sem. Oct 3, 2016 Jan 31, 2017
II sem. Mar 1, 2017 Jun 9, 2017
Exam sessions
Session From To
Sessione invernale Appelli d'esame Feb 1, 2017 Feb 28, 2017
Sessione estiva Appelli d'esame Jun 12, 2017 Jul 31, 2017
Sessione autunnale Appelli d'esame Sep 1, 2017 Sep 29, 2017
Degree sessions
Session From To
Sessione estiva Appelli di Laurea Jul 18, 2017 Jul 18, 2017
Sessione autunnale Appelli di laurea Nov 22, 2017 Nov 22, 2017
Sessione invernale Appelli di laurea Mar 20, 2018 Mar 20, 2018
Holidays
Period From To
Festa di Ognissanti Nov 1, 2016 Nov 1, 2016
Festa dell'Immacolata Concezione Dec 8, 2016 Dec 8, 2016
Vacanze di Natale Dec 23, 2016 Jan 8, 2017
Vacanze di Pasqua Apr 14, 2017 Apr 18, 2017
Anniversario della Liberazione Apr 25, 2017 Apr 25, 2017
Festa del Lavoro May 1, 2017 May 1, 2017
Festa della Repubblica Jun 2, 2017 Jun 2, 2017
Vacanze estive Aug 8, 2017 Aug 20, 2017

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

B C D F G L M O P Q S U

Belussi Alberto

alberto.belussi@univr.it +39 045 802 7980

Bombieri Nicola

nicola.bombieri@univr.it +39 045 802 7094

Bonacina Maria Paola

mariapaola.bonacina@univr.it +39 045 802 7046

Bonnici Vincenzo

vincenzo.bonnici@univr.it +39 045 802 7045

Boscaini Maurizio

maurizio.boscaini@univr.it

Carra Damiano

damiano.carra@univr.it +39 045 802 7059

Combi Carlo

carlo.combi@univr.it 045 802 7985

Daffara Claudia

claudia.daffara@univr.it +39 045 802 7942

Dalla Preda Mila

mila.dallapreda@univr.it

Di Pierro Alessandra

alessandra.dipierro@univr.it +39 045 802 7971

Drago Nicola

nicola.drago@univr.it 045 802 7081

Fiorini Paolo

paolo.fiorini@univr.it 045 802 7963

Fummi Franco

franco.fummi@univr.it 045 802 7994

Giachetti Andrea

andrea.giachetti@univr.it +39 045 8027998

Giacobazzi Roberto

roberto.giacobazzi@univr.it +39 045 802 7995

Gobbi Bruno

bruno.gobbi@univr.it

Gregorio Enrico

Enrico.Gregorio@univr.it 045 802 7937

Lora Michele

michele.lora@univr.it

Marzola Pasquina

pasquina.marzola@univr.it 045 802 7816 (ufficio); 045 802 7614 (laboratorio)

Mastroeni Isabella

isabella.mastroeni@univr.it +39 045 802 7089

Menegaz Gloria

gloria.menegaz@univr.it +39 045 802 7024

Oliboni Barbara

barbara.oliboni@univr.it +39 045 802 7077

Posenato Roberto

roberto.posenato@univr.it +39 045 802 7967

Pravadelli Graziano

graziano.pravadelli@univr.it +39 045 802 7081

Quaglia Davide

davide.quaglia@univr.it +39 045 802 7811

Segala Roberto

roberto.segala@univr.it 045 802 7997

Setti Francesco

francesco.setti@univr.it +39 045 802 7804

Spoto Nicola Fausto

fausto.spoto@univr.it +39 045 8027940

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.

ModulesCreditsTAFSSD
6
A
(MAT/02)
12
A
(ING-INF/05)
6
A
(FIS/01)
6
A
(INF/01)
12
A
(INF/01)
English language competence-complete b1 level
6
E
-
ModulesCreditsTAFSSD
12
B
(INF/01)
6
C
(FIS/01)
6
B
(ING-INF/05)
12
B
(ING-INF/05)
One course to be chosen among the following
ModulesCreditsTAFSSD
12
B
(ING-INF/05)
One course to be chosen among the following
6
B
(INF/01)
6
B
(INF/01)
6
F
(-)
Prova finale
6
E
(-)

1° Year

ModulesCreditsTAFSSD
6
A
(MAT/02)
12
A
(ING-INF/05)
6
A
(FIS/01)
6
A
(INF/01)
12
A
(INF/01)
English language competence-complete b1 level
6
E
-

2° Year

ModulesCreditsTAFSSD
12
B
(INF/01)
6
C
(FIS/01)
6
B
(ING-INF/05)
12
B
(ING-INF/05)
One course to be chosen among the following

3° Year

ModulesCreditsTAFSSD
12
B
(ING-INF/05)
One course to be chosen among the following
6
B
(INF/01)
6
B
(INF/01)
6
F
(-)
Prova finale
6
E
(-)

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.




SPlacements in companies, public or private institutions and professional associations

Teaching code

4S02709

Coordinatore

Roberto Segala

Credits

12

Scientific Disciplinary Sector (SSD)

INF/01 - INFORMATICS

Language

Italian

Period

II sem., I sem.

Learning outcomes

Provide the foundamental tools to design algorithmic solutions for concrete programs. The algorithms are evaluated and compared based required amount of resources. At the end of the course students know the main algorithms for sorting, selection, priority queues, graph visit, shortest paths, minimum spanning tree, max flow. They can also solve algorithmic problems of medium complexity and can compare algorithms based on their computational complexity.

Program

Complexity: complexity of algorithms, asymptotic notation, resolution of recurrence equations.
Sorting and selection: insertion sort, merge sort, heap sort, quick sort, randomized quick sort. Linear algorithms, counting sort, radix sort, bucket sort. Selection algorithms.
Data structures: heap, binary search trees, RB-trees, B-trees, binomial heaps, hash tables, priority queues, disjoint sets, extension of data structures, graphs.
Design and analisis of alsorithms: divide et impera, greedy, dynamic programming, local serch, backtracking, branch and bound.
Foundamental algorithms: minimum spanning tree (Prim and Kruskal), linear programing (simplex and basic elements of the elipsoid method) shortest path with single source (Dijkstra and Bellman-Ford) and multiple source (Floyd-Warshall and Johnson), maximum flow (Ford-Fulkerson, Karp), maximnal matching on bipartite graph.

Bibliografia

Reference texts
Author Title Publishing house Year ISBN Notes
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 exam consists of a writtene test of three hours, divided into two parts, and possibly of an oral colloquium.

The forst part of the written test consists of several questions with multiple choices. It produces a valuation from 0 to 30. The exam is not passed if the evaluation is below 18. The exam ends if the evaluation is between 18 and 23. The second part of the written test, available only if the evaluation of the first part is at least 24, consists of one or more exercises of increasing complexity. The evaluation is between 24 and 30.

The optional oral examination is available only if the evaluation of the second part of the written test is at least 27.

The evaluation scale is the following. 18-28 (pure notionistic knowledge), 22-24 (acceptable understanding of the arguments), 25-27 (ability to apply the concepts learned in the course), 28-30 (ability to elaborate autonomous ideas based on the concepts learned in the course).

Type D and Type F activities

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.

Graduation

List of theses and work experience proposals

theses proposals Research area
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
Domain Adaptation Computer Science and Informatics: Informatics and information systems, computer science, scientific computing, intelligent systems - Computer graphics, computer vision, multi media, computer games
Domain Adaptation Computer Science and Informatics: Informatics and information systems, computer science, scientific computing, intelligent systems - Machine learning, statistical data processing and applications using signal processing (e.g. speech, image, video)
BS or MS theses in automated reasoning Computing Methodologies - ARTIFICIAL INTELLIGENCE
Domain Adaptation Computing Methodologies - IMAGE PROCESSING AND COMPUTER VISION
Domain Adaptation Computing methodologies - Machine learning
Dati geografici Information Systems - INFORMATION SYSTEMS APPLICATIONS
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 delle basi di dati/sistemi informativi Various topics

Gestione carriere


Area riservata studenti


Attendance

As stated in point 25 of the Teaching Regulations for the A.Y. 2021/2022, attendance at the course of study is not mandatory.
Please refer to the Crisis Unit's latest updates for the mode of teaching.

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.