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 |
|---|---|---|
| 1st Semester | Oct 1, 2009 | Jan 31, 2010 |
| 2nd Semester | Mar 1, 2010 | Jun 15, 2010 |
| Session | From | To |
|---|---|---|
| Sessione straordinaria | Feb 1, 2010 | Feb 28, 2010 |
| Sessione estiva | Jun 16, 2010 | Jul 31, 2010 |
| Sessione autunnale | Sep 1, 2010 | Sep 30, 2010 |
| Session | From | To |
|---|---|---|
| Sessione autunnale | Oct 1, 2009 | Oct 1, 2009 |
| Sessione straordinaria | Dec 3, 2009 | Dec 3, 2009 |
| Sessione invernale | Mar 24, 2010 | Mar 24, 2010 |
| Sessione estiva | Jul 19, 2010 | Jul 19, 2010 |
| Period | From | To |
|---|---|---|
| Festa di Ognissanti | Nov 1, 2009 | Nov 1, 2009 |
| Festa dell'Immacolata Concezione | Dec 8, 2009 | Dec 8, 2009 |
| Vacanze Natalizie | Dec 21, 2009 | Jan 6, 2010 |
| Vacanze Pasquali | Apr 2, 2010 | Apr 6, 2010 |
| Festa della Liberazione | Apr 25, 2010 | Apr 25, 2010 |
| Festa del Lavoro | May 1, 2010 | May 1, 2010 |
| Festa del Santo Patrono di Verona S. Zeno | May 21, 2010 | May 21, 2010 |
| Festa della Repubblica | Jun 2, 2010 | Jun 2, 2010 |
| Vacanze Estive | Aug 9, 2010 | Aug 15, 2010 |
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
nome.cognome[at]uniud.it
massimo.guerriero@univr.it
gino.mariotto@univr.it
Tapparo Francesco
Todorov Velitchko
velitchko.todorov@univr.it
Ulas Mehmet Aydin
mehmetaydin.ulas@univr.it
+39 045 802 7049
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. 2010/2011
| Modules | Credits | TAF | SSD |
|---|
3° Year activated in the A.Y. 2011/2012
| Modules | Credits | TAF | SSD |
|---|
Due insegnamenti a sceltaUn insegnamento a scelta| Modules | Credits | TAF | SSD |
|---|
| Modules | Credits | TAF | SSD |
|---|
| Modules | Credits | TAF | SSD |
|---|
Due insegnamenti a sceltaUn insegnamento a sceltaLegend | 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 PER BIOINFORMATICA (2010/2011)
Teaching code
4S02709
Teacher
Credits
6
Language
Italian
Scientific Disciplinary Sector (SSD)
INF/01 - INFORMATICS
Period
I semestre dal Oct 4, 2010 al Jan 31, 2011.
To show the organization of the course that includes this module, follow this link: Course organization
Learning outcomes
Objective of the course is to teach the basics in design and analysis of algorithms with emphasis on problems of interests for bioinformatics.
Program
Algorithms and complexity: big-O notation. Divide-and-conquer algorithms. Sorting algorithms. Data structures. Graph algorithms. Exhaustive search. Greedy algorithms. Dynamic programming.
| Author | Title | Publishing house | Year | ISBN | Notes |
|---|---|---|---|---|---|
| Neil C. Jones, Pavel A. Pevzner | An introduction to bioinformatics algorithms (Edizione 1) | MIT Press | 2004 | 0-262-10106-8 | |
| Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein | Introduction to Algorithms (Edizione 3) | MIT Press | 2009 | 978-0-262-53305-8 |
Examination Methods
The grade in Algorithms for Bioinformatics (AB) is worth 50% of the grade in the Algorithms class.
AB via multiple tests (only for the exams at the end of the course (February)): AB = 35% C1 + 40% C2 + 25% CC, where C1 and C2 are written tests in class and CC are the homeworks.
AB via single test: AB = 100% E, where E is a written test, whose difficulty equals that of C1 + C2 + CC.
If a student hands in E, the vote determined by C1 + C2 is cancelled. There is no choosing of grades.
In order to withdraw it is sufficient not to hand-in the test.
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.
Tutoring faculty members
Graduation
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.
