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 sem. | Oct 3, 2016 | Jan 31, 2017 |
| II sem. | Mar 1, 2017 | Jun 9, 2017 |
| 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 |
| 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 |
| 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.
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 |
|---|
| Modules | Credits | TAF | SSD |
|---|
1° Year
| Modules | Credits | TAF | SSD |
|---|
2° Year
| Modules | Credits | TAF | SSD |
|---|
3° Year
| 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 PER BIOINFORMATICA (2016/2017)
Teaching code
4S02709
Teacher
Credits
6
Scientific Disciplinary Sector (SSD)
INF/01 - INFORMATICS
Language
Italian
Period
I sem. dal Oct 3, 2016 al Jan 31, 2017.
To show the organization of the course that includes this module, follow this link: Course organization
Learning outcomes
The course aims at providing the fundamental (methodological) tools for the design and analysis of algorithms with some emphasis on problems of interests for bioinformatics. In the presentation of the main technique of algorithm design, applications and example will be preferably taken from the area of bioinformatics and computational biology.
The course will provide the students with the knowledge and skills necessary to be able to model simple problems in terms of computational problems; to quantify the computational resources necessary to execute an algorithm, hence to compare different algorithmic solutions in terms of their computational cost. In particular, a student who profitably attended the course, will be able to evaluate the applicability and effectiveness of basic algorithmic design techniques to simple computational problems.
Program
Basic definitions: Computational Problems and Algorithms
Analysis of algorithms: worst case and average case analysis;
Algorithmic complexity: asymptotic notations; basic tools for the analysis of algorithms; solution of recurrences;
Algorithms for searching sorting and selection.
Data Structure for the implementing a dictionary: queues, heaps, binary search trees, hash tables;
Design techniques: divide and conquer; greedy; dynamic programming;
Graphs and Graph algorithms: graph traversals, basic connectivity problems, topological sorting
Bibliografia
| Author | Title | Publishing house | Year | ISBN | Notes |
|---|---|---|---|---|---|
| J. Kleinberg, É. Tardos | Algorithm Design (Edizione 1) | Addison Wesley | 2006 | 978-0321295354 | |
| 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 exam verifies that the students have acquired sufficient confidence and skill in the use of basic algorithmic design and algorithmic analysis tools.
The exam consists of a written test with open questions. The test includes some mandatory exercises and a set of exercises among which the student can choose what to work on. The mandatory exercises are meant to evaluate the student's knowledge of classical algorithms and analysis tools as seen during the course. "Free-choice" exercises test the ability of students to model "new" toy problems and design and analyse algorithmic solutions for it.
The exam can also be passed via two midterm tests (structured as the main final exam). The relative weight of the midterm tests is proportional to the part of the course on which their are based. The overall result of the midterm exams is only valid towards the registration at the one of the exams in February session.
The grade in "Algorithms" is given by the average of the grades achieved for the module "Algorithms for Bioinformatics" and the grade achieved for the module "Programming Laboratory II".
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
| Stage | Research area |
|---|---|
| Correlated mutations | Various topics |
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.
Gestione carriere
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.