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 magistrale in Mathematics - 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 |
---|
Modules | Credits | TAF | SSD |
---|
Modules | Credits | TAF | SSD |
---|
A course to be chosen among the following
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.
Mathematical Methods for Computer Science (2013/2014)
Teaching code
4S001438
Teacher
Coordinator
Credits
6
Language
English
Scientific Disciplinary Sector (SSD)
INF/01 - INFORMATICS
Period
II semestre dal Mar 3, 2014 al Jun 13, 2014.
Location
VERONA
Learning outcomes
This course is designed to introduce basic concepts of discrete mathematics, formal languages and automata, with hints for modeling phenomena occurring in nature. The goal is to develop the ability of the student to master discrete modeling, by means of the presentation of the state of the art and of the most recent problematics. Basic theoretical concepts (of mathematics and computer science) are recalled, to better understand both traditional and unconventional mathematical models, as well as computational models of natural processes.
Program
Fundamentals of discrete mathematics, data structures and dynamics
Basic notions of combinatorics, equivalence and order relations
Induction and recurrence, Fibonacci series
Recurrence equations solving criteria, iterative biological models
Logistic map: stability analysis, periodic orbits, and chaotic behaviour
Concepts of multisets, sequences, strings
Formal languages and Chomsky hierarchy
Specific characterization of REG, REC, CF classes
Finite state automata, Turing machines, and computational universality
Computational complexity and NP-completeness
Computational models of molecular processes
Some DNA algorithms solving SAT
Discrete models of metabolism
Examination Methods
oral exam
Teaching materials e documents
-
NotesOnLogisticMap (pdf, en, 375 KB, 5/29/14)