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, 2012 | Jan 31, 2013 |
| II semestre | Mar 4, 2013 | Jun 14, 2013 |
| Session | From | To |
|---|---|---|
| Sessione straordinaria | Feb 4, 2013 | Feb 28, 2013 |
| Sessione estiva | Jun 17, 2013 | Jul 31, 2013 |
| Sessione autunnale | Sep 2, 2013 | Sep 30, 2013 |
| Session | From | To |
|---|---|---|
| Sessione autunnale | Oct 18, 2012 | Oct 18, 2012 |
| Sessione straordinaria | Dec 12, 2012 | Dec 12, 2012 |
| Sessione invernale | Mar 21, 2013 | Mar 21, 2013 |
| Sessione estiva | Jul 16, 2013 | Jul 16, 2013 |
| Period | From | To |
|---|---|---|
| Festa di Ognissanti | Nov 1, 2012 | Nov 1, 2012 |
| Festa dell'Immacolata Concezione | Dec 8, 2012 | Dec 8, 2012 |
| Vacanze di Natale | Dec 21, 2012 | Jan 6, 2013 |
| Vacanze di Pasqua | Mar 29, 2013 | Apr 2, 2013 |
| Festa della Liberazione | Apr 25, 2013 | Apr 25, 2013 |
| Festa del Lavoro | May 1, 2013 | May 1, 2013 |
| Festa del Santo Patrono di Verona - San Zeno | May 21, 2013 | May 21, 2013 |
| Festa della Repubblica | Jun 2, 2013 | Jun 2, 2013 |
| Vacanze estive | Aug 9, 2013 | Aug 16, 2013 |
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 Enrolment 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 enrolment year.
| Modules | Credits | TAF | SSD |
|---|
| Modules | Credits | TAF | SSD |
|---|
1° Year
| Modules | Credits | TAF | SSD |
|---|
2° Year
| 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 - ALGORITMI (2012/2013)
Teaching code
4S02709
Teacher
Credits
6
Scientific Disciplinary Sector (SSD)
ING-INF/05 - INFORMATION PROCESSING SYSTEMS
Language
Italian
Period
II semestre dal Mar 4, 2013 al Jun 14, 2013.
To show the organization of the course that includes this module, follow this link: Course organization
Learning outcomes
The goal of this course is to familiarize with the main techniques and methodologies for the design and analysis of efficient algorithms.
We also present some more advanced paradigms and introduce a few approaches
for the dealing with NP-hard problems (approximation algorithms, implicit enumeration and branch & bound algorithms, fixed parameter tractability).
Recommended Prerequisite
------------------------
To attend the course lessons in a productive way, a student should be aware of the complexity issues related to problems and algorithms and interested in the design of efficient algorithms.
PROGRAMMING: c/c++ is the reference programming language.
ALGORITHMS: The student should be confident with the following concepts:
1. problems and formulations, encodings and instances
2. running time, memory consumption, worst case/average/amortized analysis, asymptotic growth and notation
3. Basic data structures as list, stack, queue, tree, heap.
4. Sorting
5. Graph representation and fundamental graph algorithms:
5.1 Graph visit: BFS, DFS.
5.2 Topological ordering. Connected component.
5.3 Minimal spanning tree. Kruskal and Prim algorithm.
5.4 Single-source shortest path: Dijkstra algorithm and Bellman-Ford one.
5.5 All-pairs shortest path: Floyd-Warshall algorithm and Johnson one.
5.6 Max flow: Ford-Fulkerson algorithm.
Program
We follow a direct approach driven by the eager of solving
interesting algorithmic problems together.
Just to draw a path, that could be the following.
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.
Recursion and induction
-----------------------
examples of the inductive approach in solving problems.
Divide et impera paradigm
-------------------------
Definition and application to some problems.
Greedy paradigm
---------------
Definition and application to some problems.
Dynamic programming paradigm
----------------------------
Definition and application to some problems.
Memoization and Dynamic programming.
Branch & Bound technique
------------------------
Definition and application to some problems.
Lower bounds and upper bounds.
Approximations algorithms
-------------------------
A few classical examples (node cover, set cover, Christofides for the metric TSP, an FPTAS for the knapsack).
Fixed parameter tractability
----------------------------
A few examples.
Kernels, iterative compression, color coding.
Bibliografia
| Author | Title | Publishing house | Year | ISBN | Notes |
|---|---|---|---|---|---|
| T. Cormen, C. Leiserson, R. Rivest | Introduction to algorithms (Edizione 1) | MIT Press | 1990 | 0262031418 | |
| 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
Part of the exam of the qualifying in Algorithms and Complexity
(the other half is Complexity).
The test for Algorithms lasts 5 houers and takes places in computer room.
It is required to design and code (in c or c++) efficient as possible
algorithms for three given problems.
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.
Gestione carriere
Graduation
List of theses and work experience proposals
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.