## 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 2, 2017 | Jan 31, 2018 |

II sem. | Mar 1, 2018 | Jun 15, 2018 |

Session | From | To |
---|---|---|

Sessione invernale d'esame | Feb 1, 2018 | Feb 28, 2018 |

Sessione estiva d'esame | Jun 18, 2018 | Jul 31, 2018 |

Sessione autunnale d'esame | Sep 3, 2018 | Sep 28, 2018 |

Session | From | To |
---|---|---|

Sessione di laurea estiva | Jul 18, 2018 | Jul 18, 2018 |

Sessione di laurea autunnale | Nov 22, 2018 | Nov 22, 2018 |

Sessione di laurea invernale | Mar 20, 2019 | Mar 20, 2019 |

Period | From | To |
---|---|---|

Christmas break | Dec 22, 2017 | Jan 7, 2018 |

Easter break | Mar 30, 2018 | Apr 3, 2018 |

Patron Saint Day | May 21, 2018 | May 21, 2018 |

Vacanze estive | Aug 6, 2018 | Aug 19, 2018 |

## 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

Bloisi Domenico Daniele

domenico.bloisi@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 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 (2017/2018)

The teaching is organized as follows:

## Learning outcomes

------------------------

MM: ALGORITMI PER BIOINFORMATICA

------------------------

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.

------------------------

MM: LABORATORIO DI PROGRAMMAZIONE II

------------------------

The objective of the course is to provide the basic knowledge to implement fundamental algorithms using object oriented programming. The reference programming language is Java. The teaching methodology includes assisted software development and the implementation of specific projects. The projects implemented during the course focus on applications that are relevant to bioinformatics. At the end of the course the student must be able to: -- implement and verify algorithms to solve basic computational problems; -- implement software modules using the object-oriented programming paradigm; -- use the main data structures available in Java and develop new data structures for the implementation of specific software modules.

## Program

------------------------

MM: ALGORITMI PER BIOINFORMATICA

------------------------

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

------------------------

MM: LABORATORIO DI PROGRAMMAZIONE II

------------------------

Object oriented programming and the Java language. Implementation of simple programs in Java (primitive types and control structures). Definition of classes and methods. Exception management in Java. Recursion. Interfaces and packages. Implementation of sorting algorithms, search (greedy and exhaustive) and main algorithms on graphs, applied to problems that are relevant to bioinformatics. All the teaching material for this course is available on the course web page hosted on the teachers' web site.

## Examination Methods

------------------------

MM: ALGORITMI PER BIOINFORMATICA

------------------------

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".

------------------------

MM: LABORATORIO DI PROGRAMMAZIONE II

------------------------

The grade in "Algorithms" is given by the average of the grades in "Algorithms for Bioinformatics" and the grade in "Programming Laboratory II". The exam for "Programming Laboratory II" involves the implementation and verification of code written in Java language and it is performed using the computer. The exam can be carried out by partial tests or by a single test. Partial exam is made up of a computer test (conducted in the lab during the course) and a project (developed during the course) that will be presented in an oral exam to the teacher at the end of the course. The final vote is given by the average of the votes of the two partial tests. Exam without partial testing is a single computer test performed at the exam dates. All tests and projects are individual work. Cheating is strictly forbidden and will determine lowering of grades for all students involved.

## Bibliografia

Author | Title | Publishing house | Year | ISBN | Notes |
---|---|---|---|---|---|

J. Kleinberg, É. Tardos | Algorithm Design (Edizione 1) | Addison Wesley | 2006 | 978-0321295354 | |

H.J. Böckenhauer, D. Bongartz | Algorithmic Aspects of Bioinformatics | Springer | 2007 | ||

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 |

## 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.

## 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.

## Graduation

## List of theses and work experience proposals

Stage | Research area |
---|---|

Correlated mutations | Various topics |

## 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.