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 |
---|---|---|
1° | Sep 30, 2002 | Nov 29, 2002 |
2° | Jan 13, 2003 | Mar 14, 2003 |
3° | Apr 7, 2003 | Jun 13, 2003 |
Session | From | To |
---|---|---|
First term | Dec 9, 2002 | Dec 20, 2002 |
Second term | Mar 24, 2003 | Apr 4, 2003 |
Third term | Jun 23, 2003 | Jul 4, 2003 |
First extra term | Jul 7, 2003 | Jul 18, 2003 |
Second extra term | Sep 1, 2003 | Sep 12, 2003 |
Third extra term | Sep 15, 2003 | Sep 26, 2003 |
Period | From | To |
---|---|---|
Easter Holidays | Apr 18, 2003 | Apr 27, 2003 |
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.
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 enrollment year.
4° Year activated in the A.Y. 2005/2006
Modules | Credits | TAF | SSD |
---|
5° Year activated in the A.Y. 2006/2007
Modules | Credits | TAF | SSD |
---|
Modules | Credits | TAF | SSD |
---|
Modules | Credits | TAF | SSD |
---|
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.
Advanced algorithms (2006/2007)
Teaching code
4S01076
Teacher
Credits
5
Also offered in courses:
- Advanced algorithms of the course Masters in Intelligent and Multimedia Systems
Language
Italian
Scientific Disciplinary Sector (SSD)
INF/01 - INFORMATICS
Period
3rd quadrimester dal Apr 2, 2007 al Jun 8, 2007.
Location
VERONA
Learning outcomes
The goal of this course is to introduce some advanced paradigms for algorithms development and analysis in order to solve optimization problems.
Program
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.
Quantum algorithms
------------------
Introduction to qubit, quantum state concepts. Information coding by qubits. Quantum algorithms. One example of quantum algorithm: Fourier Quantum Transform.
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 | consultazione |
Alan Bertossi | Algoritmi e strutture dati (Edizione 1) | UTET | 2000 | 88-7750-611-3 | consultazione |
G. Brassard, P. Bratley | Fundamentals of Algorithms | Prentice-Hall | 1996 | 0133350681 | consultazione |
T. Cormen, C. Leiserson, R. Rivest, C. Stein | Introduzione agli Algoritmi e Strutture Dati (Edizione 2) | McGraw-Hill | 2005 | 88-386-6251-7 | consultazione |
Examination Methods
The final exam consists of a written part followed, if it is sufficient, by an oral part.
Teaching materials e documents
- Programma dettagliato (html, it, 13 KB, 07/06/07)
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 soon also via the Univr app.