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 Matematica applicata - 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.
Computer Programming with Laboratory (2009/2010)
Teaching code
4S02751
Credits
12
Language
Italian
Location
VERONA
Scientific Disciplinary Sector (SSD)
INF/01 - INFORMATICS
The teaching is organized as follows:
Teoria
Laboratorio
Learning outcomes
We study the programming principles and their application to the solution of problems, mathematical ones in particular, by means if a programming language.
In the laboratory we learn how to develop project of small or medium size in a specific programming language.
Program
THEORY
Introduction to Computing Science.
Part I - problems, algorithms and programs.
- Basics: problem, specifics, algorithm; abstact machine, compiler and interpreter; programming languages.
- Introduction to the programming language.
- Elementary programming: basic instructions and develoment of simple programs.
- Data types. The general concept of data type: characterization and data representation. Variables, expressions and assignment. Abstract Data Types.
- Primitive data types: characterization, usage and related problems.
- Program structure. Fundamental instructions.
- Sub-programs: structure, parameters and visibility.
- Structured data types. Arrays, pointers, strings and other data structures.
- Basics of objects.
- Dynamic data structures.
Part II - Analysis of Algorithms
- Correctness: termination, logic properties; methods for the correctness verification.
- Introduction to the complexity. Performance of algorithms. Evaluation of efficiency. Computational costs.
- Asymptotic estimation of the complexity in time and space. The worst and medium case.
- Amortized analysis.
- Static sequences: implementation and algorithms.
- Matrices: implementation, operations and algorithms.
- Dynamic sequences: abstract definition and implementation; basic operations.
- Trees. Abstract definition and implementation. Basic operation. Binay research trees.
- Introduction to graphs.
Basics of Object Oriented Programming
LABORATORY
In the laboratory we familiarize with the programming language developing projects based on the ideas presented in the lessons.
We study the fundamental elements of the language and we deal with the problems that arise in the development of the solution; in particular we acquire skill in editing, compiling, debugging and basic project menagement.
Bibliography
Activity | Author | Title | Publishing house | Year | ISBN | Notes |
---|---|---|---|---|---|---|
Teoria | Sciuto, Buonanno, Mari | Introduzione ai sistemi informatici 4/ed | McGraw-Hill | 2008 | 9788838664311 | Testo di riferimento per l'introduzione all'informatica |
Teoria | Bertacca M. e Guidi A. | Programmare in Java | McGraw-Hill | 2007 | 978-88-386-6400-7 | Testo di riferimento per il linguaggio di programmazione |
Teoria | Crescenzi, P. - Gambosi, G. - Grossi, R. | Strutture di Dati e Algoritmi | Pearson Education Italia | 2006 | 8871922735 | Testo di riferimento per lo studio e l'analisi degli algoritmi e delle strutture dati |
Examination Methods
The final exam is unique and consists in two parts:
- a written part concerning the subject of the course and the laboratory projects.
- an oral part: the admission to this part is allowed only after passing the first one.