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 |
---|
2° Year activated in the A.Y. 2010/2011
Modules | Credits | TAF | SSD |
---|
3° Year activated in the A.Y. 2011/2012
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.
Programming I (2009/2010)
Teaching code
4S02723
Credits
12
Language
Italian
Scientific Disciplinary Sector (SSD)
INF/01 - INFORMATICS
The teaching is organized as follows:
Teoria
Laboratorio
Learning outcomes
The introduction to computer programming in the C language. At the end of the course, the student will be able to write and understand simple C programs.
Program
First part (October-January):
- Introduction to computers, numerical representations and programming languages
- Introduction to imperative programming: flow diagrams and structured programming
- First C programs: keyboard input and screen output
- Control structures
- Functions
- Arrays
- Pointers
Second part (March-May):
- Characters and strings
- Recursive functions
- Input/output formatting
- Structures and unions
- File handling
- Basic data structures in C: lists, stacks, queues and trees
- The C preprocessor
Bibliography
Activity | Author | Title | Publishing house | Year | ISBN | Notes |
---|---|---|---|---|---|---|
Teoria | H.M. Deitel & P.J. Deitel | C, Corso Completo di Programmazione (Edizione 3) | Apogeo | 2007 |
Examination Methods
A written exam will prove that the student has learned the theoretical and practical notions of the course. Two partial, non-compulsory written tests are scheduled for February and June; by passing both of them the student avoids the final exam.