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.
Study Plan
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:
Laurea in Bioinformatica - Enrollment from 2025/2026The 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. 2015/2016
Modules | Credits | TAF | SSD |
---|
3° Year activated in the A.Y. 2016/2017
Modules | Credits | TAF | SSD |
---|
Un insegnamento a scelta
Due insegnamenti a scelta
Modules | Credits | TAF | SSD |
---|
Modules | Credits | TAF | SSD |
---|
Modules | Credits | TAF | SSD |
---|
Un insegnamento a scelta
Due insegnamenti a scelta
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.
Informational Methods (2014/2015)
Teaching code
4S00995
Teacher
Coordinator
Credits
6
Language
Italian
Scientific Disciplinary Sector (SSD)
INF/01 - INFORMATICS
Period
II sem. dal Mar 2, 2015 al Jun 12, 2015.
Learning outcomes
The course intends to introduce the fundamental discrete structure by emphasizing their use in the definition of mathematical models of biological relevance. In the first part, after an introduction to the basic discrete structures, the number systems are analyzed, with the number representation systems, and the principle of structural induction. Then, the main concepts of formal language theory are presented, by concluding with the study of the principal combinatorial schemata.
Program
Discrete structures: sets, multisets, sequences, strings, operations, relations, functions, variables, parentheses and expressions. Numbers and induction: number systems, number representations, proofs by induction, definitions by induction of important number sequences. Structural induction over strings, trees e graphs. Outlines of first order logical languages (terms, formulas, interpretations). Formal languages, grammars and automata. Patterns and regular expressions, Chomsky hierarchy, finite state automata. Computing automata and Turing macjine. Decidability, semidecidability ed undecidability. Elements of combinatorics: allocations and partitions, binomial and multinomial coefficients. Enumeration of partitions and multisets. Numbers of Stirling, Bell, Catalan. Magnitude orders and asymptotic orders. Outlines of discrete probability.
Examination Methods
Written and oral examination.