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
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 |
|---|
Un insegnamento a scelta tra i seguenti3° Year activated in the A.Y. 2016/2017
| Modules | Credits | TAF | SSD |
|---|
Un insegnamento a scelta tra i seguenti| Modules | Credits | TAF | SSD |
|---|
| Modules | Credits | TAF | SSD |
|---|
Un insegnamento a scelta tra i seguenti| Modules | Credits | TAF | SSD |
|---|
Un insegnamento a scelta tra i seguentiLegend | 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.
Programming I (2014/2015)
Teaching code
4S02723
Credits
12
Language
Italian
Scientific Disciplinary Sector (SSD)
INF/01 - INFORMATICS
The teaching is organized as follows:
Teoria
Laboratorio [Laboratorio II turno M-Z]
Laboratorio [Laboratorio I turno A-I]
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
| 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. The final 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 4 examinations 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.
