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.

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.

2° Year  activated in the A.Y. 2013/2014

ModulesCreditsTAFSSD
12
B
INF/01
6
C
FIS/01
6
B
ING-INF/05
12
B
ING-INF/05
Un insegnamento a scelta tra i seguenti:

3° Year  activated in the A.Y. 2014/2015

ModulesCreditsTAFSSD
12
B
INF/01
Un insegnamento a scelta tra i seguenti:
Prova finale
6
E
-
activated in the A.Y. 2013/2014
ModulesCreditsTAFSSD
12
B
INF/01
6
C
FIS/01
6
B
ING-INF/05
12
B
ING-INF/05
Un insegnamento a scelta tra i seguenti:
activated in the A.Y. 2014/2015
ModulesCreditsTAFSSD
12
B
INF/01
Un insegnamento a scelta tra i seguenti:
Prova finale
6
E
-

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.




S Placements in companies, public or private institutions and professional associations

Teaching code

4S000018

Coordinator

Andrea Masini

Credits

6

Language

Italian

Scientific Disciplinary Sector (SSD)

INF/01 - INFORMATICS

Period

II semestre dal Mar 4, 2013 al Jun 14, 2013.

Learning outcomes

The main objective of this course is the introduction of the fundamental notions of symbolic logic (syntax, semantics, deductive systems) and of discrete mathematics (sets, functions, graphs, trees, structures).

Program

Part 1 (4CFU) Discrete Mathematics

Natural numbers and induction, applications and functions, relations, equivalences, partitions, orders, cardinality, finite, denumerable and not denumerable sets, (Cantor's theorem), ordering of the cardinals;

Graphs and trees, paths, Eulerian circuits, planar graphs and trees.

Part 2 (2CFU) Logic

Propositional language: propositions and connectives, truth tables, valuations;
Structures: notable examples, monoids, semigroups, natural numbers, graphs;
The language of the first order: Tarski semantics, logical consequence;

Reference texts
Author Title Publishing house Year ISBN Notes
Alberto Facchini Algebra e Matematica Discreta (Edizione 1) Edizioni Decibel/Zanichelli 2000 978-8808-09739-2
Andrea Asperti, Agata Ciabattoni Logica a Informatica McGraw-Hill 2007

Examination Methods

Written exam

Esame scritto:
L'esame si articola in due prove:
- prova n1 (non verbalizzante)
test a risposte multiple (20 domande) 1 punto per ogni risposta esatta, 0 punti per le risposte non date, -1 punto per ogni risposta errata. La prova n1 si considera superata se la sommatore a dei punti e' MAGGIORE O UGUALE a 10.
il SUPERAMENTO DELLA PROVA n1 è condizione necessaria e sufficiente per poter sostenere la prova n2.
La votazione ottenuta nella prova n1 non non contribuisce al voto finale.

- prova n2 (verbalizzante)
Esame scritto standard. Sei domande aperte. Ad ogni domanda viene attribuito il punteggio massimo di 6 punti.

Il voto finale è così attribuito:
Sia P il punteggio ottenuto nella prova n2
P < 18 : esame insuff.;
17 < P < 31 : voto = P
P > 30 : voto = 30 e Lode.

Students with disabilities or specific learning disorders (SLD), who intend to request the adaptation of the exam, must follow the instructions given HERE

Teaching materials e documents