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

4S02723

Credits

12

Language

Italian

Scientific Disciplinary Sector (SSD)

INF/01 - INFORMATICS

The teaching is organized as follows:

Teoria

Credits

8

Period

I semestre, II semestre

Academic staff

Nicola Fausto Spoto

Laboratorio

Credits

4

Period

I semestre, II semestre

Academic staff

Sara Migliorini

Learning outcomes

This course provides students with the basic abilities needed to write simple programs in the C programming language. They will learn how to organize a program in that imperative structured language and how to use it to implement simple algorithms. The relationship between the C language and the underlying machine is highlighted. The concept of recursion is put in evidence, as well as the implementation of simple data structures, both recursive and non-recursive.

Program

Von Neumann machines. Binary representation of numbers, characters, strings and commands. Binary, octal, hexadecimal numbers. Structure of a C program. Use of a C compiler. Expressions and commands. Structured programming. Assignments, conditionals and loops. Arrays. Pointers. Function calls. Activation stack. Call by value and call by reference. Structures. The C standard library. Recursion. Recursive data structures. Lists.

Bibliography

Reference texts
Activity Author Title Publishing house Year ISBN Notes
Teoria Stephen G. Kochan Programmare in C (Edizione 3) Pearson 2011 9788871926605

Examination Methods

The exam, unified with the Laboratory module, consists in two parts, that will take place around February and June. The note of each part is between 0 and 30. Students must reach at least 18 in both parts in order to successfully pass the exam. The global note is the composition of the notes of the two parts. Students who do not pass these partial exams can try again in the normal 6 examination periods scattered around the year, starting from June. Those exams are on the total program of the course. Exams (partial as well as total) verify the ability in writing simple programs, on paper and without the use of a computer. The important point is the ability to organize algorithms and data structures and translate them into the C language with no significant syntactical errors.

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