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.

This information is intended exclusively for students already enrolled in this course.
If you are a new student interested in enrolling, you can find information about the course of study on the course page:

Bachelor's degree in Bioinformatics - Enrollment from 2025/2026

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

ModulesCreditsTAFSSD
12
C
CHIM/03 ,CHIM/06
6
A
FIS/01
English B2
6
E
-

2° Year  activated in the A.Y. 2025/2026

ModulesCreditsTAFSSD
12
B
INF/01
6
C
BIO/18

3° Year  It will be activated in the A.Y. 2026/2027

ModulesCreditsTAFSSD
Final exam
3
E
-
ModulesCreditsTAFSSD
12
C
CHIM/03 ,CHIM/06
6
A
FIS/01
English B2
6
E
-
activated in the A.Y. 2025/2026
ModulesCreditsTAFSSD
12
B
INF/01
6
C
BIO/18
It will be activated in the A.Y. 2026/2027
ModulesCreditsTAFSSD
Final exam
3
E
-
Modules Credits TAF SSD
Between the years: 2°- 3°
1 module among the following (Discrete Biological Models 2nd year, other modules 3rd year)
Between the years: 2°- 3°
1 module among the following (Elements of physiology and Biophysics 2nd year, Model organism in biotechnology research and Molecular biology laboratory 3rd year)
6
C
FIS/07
Between the years: 2°- 3°
Between the years: 2°- 3°
Further activities
3
F
-

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.




S Placements in companies, public or private institutions and professional associations

Teaching code

4S02709

Credits

12

Coordinator

Roberto Posenato

Language

Italian

Courses Single

Authorized

The teaching is organized as follows:

Algorithms for Bioinformatics

Credits

6

Period

2nd semester

Academic staff

Roberto Posenato

Programming Lab II

Credits

6

Period

See the unit page

Academic staff

See the unit page

Learning objectives

The course aims at providing the fundamental methodological tools for the design and analysis of al-gorithms with emphasis on their employment in the solution of simple bioinformatics problems. The students will learn to implement basic algorithmic solution and fundamental data structures for solving problems in bioinformatics by employing object oriented programming. The course is structured on two modules: Algoritmi per Bioinformatica and Laboratorio di Programmazione II, which are detaled below. Module 1: The students will learn foundations of algorithm design and analysis. They will be able to model simple (real world) 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 has profitably attended the course, will be able to evaluate the applicability and effectiveness of basic algorithmic design techniques to simple computational problems. Module 2: The aim of this module 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 focussed on applications that are relevant to bioinformatics. At the end of the course the student will be able to use the main data structures available in Java and develop new data structures for the implementation of specific software modules.

Prerequisites and basic notions

Knowledge of the fundamental concepts of discrete mathematics, probability calculus and graph theory. Sequences and series.
Resolution of the most important series. Concept of probability, space of events, random variables, probability distribution functions. Mean, variance. Independent random variables. Fundamental probability functions: uniform, geometric, Bernoulli, binomial and normal (Gaussian). Equations of recurrence. Graph, Directed graph, Degree of node and graph, Path, Weighted path, Cycle. Tree, rooted tree, binary tree.
Knowledge of the fundamental concepts of programming:
Basic scalar types: integer, decimal (scientific notation), character, boolean
Concept of variable and parameter. Array.
Instructions: assignment, IF, FOR and WHILE loops.
Procedures, Functions, Procedure Call, Parameter Passing by Value and by reference.
Recursive procedures.

Bibliography

Visualizza la bibliografia con Leganto, strumento che il Sistema Bibliotecario mette a disposizione per recuperare i testi in programma d'esame in modo semplice e innovativo.

Criteria for the composition of the final grade

The exam consists of a single written exam divided into two parts (details in the modules). The exam is passed if you obtain at least 18 points in both tests, and the final grade is given by the arithmetic mean of the points obtained in the two tests.
The instructor reserves the right to validate or invalidate the exam grade with an additional oral examination if they believe the written test was not completed fairly.