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 3, 2011 | Jan 31, 2012 |
| II semestre | Mar 1, 2012 | Jun 15, 2012 |
| Session | From | To |
|---|---|---|
| Sessione straordinaria | Feb 1, 2012 | Feb 29, 2012 |
| Sessione estiva | Jun 18, 2012 | Jul 31, 2012 |
| Sessione autunnale | Sep 3, 2012 | Sep 28, 2012 |
| Session | From | To |
|---|---|---|
| Sessione autunnale | Oct 19, 2011 | Oct 19, 2011 |
| Sessione straordinaria | Dec 13, 2011 | Dec 13, 2011 |
| Sessione invernale | Mar 21, 2012 | Mar 21, 2012 |
| Sessione estiva | Jul 16, 2012 | Jul 16, 2012 |
| Period | From | To |
|---|---|---|
| Festa di Ognissanti | Nov 1, 2011 | Nov 1, 2011 |
| Festa dell'Immacolata Concezione | Dec 8, 2011 | Dec 8, 2011 |
| Vacanze Natalizie | Dec 22, 2011 | Jan 6, 2012 |
| Vacanze Pasquali | Apr 5, 2012 | Apr 10, 2012 |
| Festa della Liberazione | Apr 25, 2012 | Apr 25, 2012 |
| Festa del Lavoro | May 1, 2012 | May 1, 2012 |
| Festa del Patrono di Verona S. Zeno | May 21, 2012 | May 21, 2012 |
| Festa della Repubblica | Jun 2, 2012 | Jun 2, 2012 |
| Vacanze estive | Aug 8, 2012 | Aug 15, 2012 |
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
Bertelle Roberto
federica.briata@univr.it
Guarnieri Valerio
valerio.guarnieri@univr.it
+39 045 802 7085
massimo.guerriero@univr.it
luca.vigano@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.
1° Year
| Modules | Credits | TAF | SSD |
|---|
2° Year activated in the A.Y. 2012/2013
| Modules | Credits | TAF | SSD |
|---|
3° Year activated in the A.Y. 2013/2014
| Modules | Credits | TAF | SSD |
|---|
Un insegnamento a scelta tra i seguenti:| Modules | Credits | TAF | SSD |
|---|
| Modules | Credits | TAF | SSD |
|---|
| Modules | Credits | TAF | SSD |
|---|
Un insegnamento a scelta tra i seguenti: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 (2012/2013)
Teaching code
4S02709
Credits
12
Language
Italian
Scientific Disciplinary Sector (SSD)
INF/01 - INFORMATICS
The teaching is organized as follows:
Teoria
Laboratorio
Learning outcomes
Provide the foundamental tools to design algorithmic solutions for concrete programs. The algorithms are evaluated and compared based required amount of resources.
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.
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.
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: only in this way will you be able to receive notification of all the notices from your teachers and your secretariat via email and also via the Univr app.
Graduation
List of thesis 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 dell'analisi dei dati | Various topics |
Attendance modes and venues
As stated in the Teaching Regulations, attendance at the course of study is not mandatory.
Part-time enrolment is permitted. Find out more on the Part-time enrolment possibilities page.
The course's teaching activities take place in the Science and Engineering area, which consists of the buildings of Ca‘ Vignal 1, Ca’ Vignal 2, Ca' Vignal 3 and Piramide, located in the Borgo Roma campus.
Lectures are held in the classrooms of Ca‘ Vignal 1, Ca’ Vignal 2 and Ca' Vignal 3, while practical exercises take place in the teaching laboratories dedicated to the various activities.
