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.
Academic calendar
The academic calendar shows the deadlines and scheduled events that are relevant to students, teaching and technical-administrative staff of the University. Public holidays and University closures are also indicated. The academic year normally begins on 1 October each year and ends on 30 September of the following year.
Course calendar
The Academic Calendar sets out the degree programme lecture and exam timetables, as well as the relevant university closure dates..
Period | From | To |
---|---|---|
I sem. | Oct 1, 2014 | Jan 30, 2015 |
II sem. | Mar 2, 2015 | Jun 12, 2015 |
Session | From | To |
---|---|---|
Sessione straordinaria appelli d'esame | Feb 2, 2015 | Feb 27, 2015 |
Sessione estiva appelli d'esame | Jun 15, 2015 | Jul 31, 2015 |
Sessione autunnale appelli d'esame | Sep 1, 2015 | Sep 30, 2015 |
Session | From | To |
---|---|---|
Sessione autunnale appello di laurea 2014 | Nov 26, 2014 | Nov 26, 2014 |
Sessione invernale appello di laurea 2015 | Mar 18, 2015 | Mar 18, 2015 |
Sessione estiva appello di laurea 2015 | Jul 14, 2015 | Jul 14, 2015 |
Sessione autunnale appello di laurea 2015 | Nov 25, 2015 | Nov 25, 2015 |
Sessione invernale appello di laurea 2016 | Mar 16, 2016 | Mar 16, 2016 |
Period | From | To |
---|---|---|
Vacanze di Natale | Dec 22, 2014 | Jan 6, 2015 |
Vacanze di Pasqua | Apr 2, 2015 | Apr 7, 2015 |
Ricorrenza del Santo Patrono | May 21, 2015 | May 21, 2015 |
Vacanze estive | Aug 10, 2015 | Aug 16, 2015 |
Exam calendar
Exam dates and rounds are managed by the relevant Science and Engineering Teaching and Student Services Unit.
To view all the exam sessions available, please use the Exam dashboard on ESSE3.
If you forgot your login details or have problems logging in, please contact the relevant IT HelpDesk, or check the login details recovery web page.
Academic staff
Ugolini Simone
simone.ugolini@univr.itStudy Plan
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
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 |
---|
Modules | Credits | TAF | SSD |
---|
Modules | Credits | TAF | SSD |
---|
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 (2016/2017)
Teaching code
4S00005
Academic staff
Coordinator
Credits
6
Language
Italian
Scientific Disciplinary Sector (SSD)
INF/01 - INFORMATICS
Period
I sem. dal Oct 3, 2016 al Jan 31, 2017.
Learning outcomes
The course covers standard principles and methods in theoretical computer science, notably in automata theory and computability.
The course aims at providing theoretical computer science and programming languages capabilities.
At the end of the course, the student will have to show: to know and understand advanced computer science notions; to be able to apply the acquired capabilities and knowledge for solving problems in its field of study; to be able to develop necessary expertise for affording the following studies with a sufficient degree of autonomy.
Program
The course requires the standard courses on Programming, Algorithms, Discrete mathematics and logic. It is introductory for the advanced courses in Complexity, Programming languages and Compilers, as well as for the courses in Security and Cryptography, Static Analysis and Protection, Artificial Intelligence, Automated Deduction, Semantics, Non-standard computational models.
The course is structured in two parts.
Automata and formal languages (28h):
Formal languages and grammars,
finite state automata and regular languages,
context-free languages, normal forms, Push-down automata,
Chomsky classification of formal languages.
Computability (34h):
intuitive notion of algorithm,
Turing analysis of computable functions, Turing machines and WHILE-programs,
Church thesis,
Goedelization, universality,
Theorem s-m-n, unsolvable problems and halting problem,
metaprogramming,
recursive and recursive enumerable sets,
Recursion theorems, Rice Theorem,
reducibility, complete, creative and productive sets.
Author | Title | Publishing house | Year | ISBN | Notes |
---|---|---|---|---|---|
N. Jones | Computability and Complexity | MIT Press | 1997 | ||
John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman | Introduction to Automata Theory, Languages and Computation (Edizione 2) | Addison-Wesley | 2000 | 0201441241 | |
Michael Sipser | Introduction to the Theory of Computation | PWS | 1997 | 053494728X | |
H. Rogers | Theory of recursive functions and effective computability | MIT Press | 1988 |
Examination Methods
Written exam in 4 sessions, with intermediate evaluation. The exams are scheduled as follows: 1 intermediate (written) evaluation during the course, 1 exam in the Extraordinary Session at the end of the course, 1 exam in the Summer Session and 1 exams in the Fall Session. Each exam is split into two parts which can be passed separately and the whole evaluation is obtained as the mathematical average of the two evaluations. The exam is passed if the average evaluation is greater or equal to 18/30. Each evaluation remains valid for the whole current academic year.
Mandatory oral exam for evaluation greater than 26.
The task of the written exam consists in verifying the comprehension of course contents and the capability to apply these contents in the resolution of exercises in which students have to mainly classify languages (regular or context free) and sets (recursive theory and completeness) by using the formal proof tools provided in the course.
The task of the oral exam is that of verify an advanced comprehension of the course contents allowing a critic analysis and a reprocessing of the studied notions and results. This comprehension may be verified also by asking theorems and proofs.
Type D and Type F activities
Modules not yet included
Career prospects
Module/Programme news
News for students
There you will find information, resources and services useful during your time at the University (Student’s exam record, your study plan on ESSE3, Distance Learning courses, university email account, office forms, administrative procedures, etc.). You can log into MyUnivr with your GIA login details: only in this way will you be able to receive notification of all the notices from your teachers and your secretariat via email and also via the Univr app.
Graduation
List of thesis proposals
theses proposals | Research area |
---|---|
Analisi e percezione dei segnali biometrici per l'interazione con robot | AI, Robotics & Automatic Control - AI, Robotics & Automatic Control |
Integrazione del simulatore del robot Nao con Oculus Rift | AI, Robotics & Automatic Control - AI, Robotics & Automatic Control |
Domain Adaptation | Computer Science and Informatics: Informatics and information systems, computer science, scientific computing, intelligent systems - Computer graphics, computer vision, multi media, computer games |
Domain Adaptation | Computer Science and Informatics: Informatics and information systems, computer science, scientific computing, intelligent systems - Machine learning, statistical data processing and applications using signal processing (e.g. speech, image, video) |
BS or MS theses in automated reasoning | Computing Methodologies - ARTIFICIAL INTELLIGENCE |
Domain Adaptation | Computing Methodologies - IMAGE PROCESSING AND COMPUTER VISION |
Domain Adaptation | Computing methodologies - Machine learning |
Dati geografici | Information Systems - INFORMATION SYSTEMS APPLICATIONS |
Analisi e percezione dei segnali biometrici per l'interazione con robot | Robotics - Robotics |
Integrazione del simulatore del robot Nao con Oculus Rift | Robotics - Robotics |
BS or MS theses in automated reasoning | Theory of computation - Logic |
BS or MS theses in automated reasoning | Theory of computation - Semantics and reasoning |
Proposte di tesi/collaborazione/stage in Intelligenza Artificiale Applicata | Various topics |
Proposte di Tesi/Stage/Progetto nell'ambito dell'analisi dei dati | Various topics |
Attendance modes and venues
As stated in the Teaching Regulations, attendance at the course of study is not mandatory.
Part-time enrolment is permitted. Find out more on the Part-time enrolment possibilities page.
The course's teaching activities take place in the Science and Engineering area, which consists of the buildings of Ca‘ Vignal 1, Ca’ Vignal 2, Ca' Vignal 3 and Piramide, located in the Borgo Roma campus.
Lectures are held in the classrooms of Ca‘ Vignal 1, Ca’ Vignal 2 and Ca' Vignal 3, while practical exercises take place in the teaching laboratories dedicated to the various activities.