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 Informatica - 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 |
---|
Mathematical analysis 1
Computer Architecture
2° Year activated in the A.Y. 2023/2024
Modules | Credits | TAF | SSD |
---|
3° Year activated in the A.Y. 2024/2025
Modules | Credits | TAF | SSD |
---|
1 module among the following
Modules | Credits | TAF | SSD |
---|
Mathematical analysis 1
Computer Architecture
Modules | Credits | TAF | SSD |
---|
Modules | Credits | TAF | SSD |
---|
1 module among the following
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.
Foundations of Computing (2024/2025)
Teaching code
4S00005
Teacher
Coordinator
Credits
6
Language
Italian
Scientific Disciplinary Sector (SSD)
INF/01 - INFORMATICS
Period
Semester 1 dal Oct 1, 2024 al Jan 31, 2025.
Courses Single
Authorized
Learning objectives
The course covers standard principles and methods in theoretical computer science, notably in automata theory and computability. The course aims at providing skills in theoretical computer science and programming languages. At the end of the course, the student will be able to understand advanced computer science notions; to apply the acquired capabilities and knowledge for problem solving in its field of study; to be able to develop necessary expertise for affording the following studies with a sufficient degree of autonomy.
Prerequisites and basic notions
Mathematical Analysis, Logic and Algebra, Programming and Algorithms and Data Structures.
Program
The course is structured in 2 parts. Automata and formal languages: Languages and grammars, finite state automata and regular languages, context-free languages, normal forms and pushdown automata, Chomsky classification (outline). Computability: Intuitive notion of algorithm, Formal models for calculus: Turing machines/recursive functions/While programs, Church's Thesis, Goedelization, Universality and smn Theorem, Soluble and non-soluble problems: termination problem, Metaprogramming: compilation, interpretation and specialization, Recursive sets and kings, Recursion Theorems and Rice's Theorem, Functional Reducibility: Complete, creative and productive sets.
Bibliography
Didactic methods
Frontal lessons and exercises.
Learning assessment procedures
Written exam in 4 sessions with intermediate test. The exam sessions are distributed as follows: 1 intermediate exam during the course, 2 exam sessions in the Extraordinary Session at the end of the course, 1 exam session in the Summer Session, 1 exam session in the Autumn Session. Each exam is divided into two parts that can be passed separately and the overall mark of the written test is given by the mathematical average of the evaluations out of 30 obtained in the two parts. The exam is considered passed if the average of the parts is greater than or equal to 18. Each assessment remains valid for the entire current academic year. Compulsory oral exam to obtain marks above 26, optional otherwise. That is, each vote is recorded without an oral test up to a maximum of 26. The objective of the written test is to ascertain the understanding of the contents and the ability to apply these contents in solving exercises in which it is mainly necessary to recognize and classify languages (regular or context-free) and sets (recursion and completeness) through the use of the formal demonstration tools provided during the course. The objective of the oral exam is to ascertain an advanced understanding of the contents which allows a critical analysis and a re-elaboration of the concepts and results studied, also by ascertaining the knowledge of theorems and proofs.
Evaluation criteria
Mathematical and IT correctness of the exercises performed
Criteria for the composition of the final grade
50% Part One and 50% Part Two
Exam language
Italiano