Mathematical Methods for Computer Science (2013/2014)

Course code
Name of lecturer
Giuditta Franco
Giuditta Franco
Number of ECTS credits allocated
Academic sector
Language of instruction
II semestre dal Mar 3, 2014 al Jun 13, 2014.

Lesson timetable

II semestre
Day Time Type Place Note
Tuesday 4:30 PM - 6:30 PM lesson Lecture Hall M  
Thursday 3:30 PM - 5:30 PM lesson Lecture Hall M  

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.


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

Assessment methods and criteria

oral exam

Teaching aids