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. 2013/2014
| Modules | Credits | TAF | SSD |
|---|
One course chosen from the following two3° Year activated in the A.Y. 2014/2015
| Modules | Credits | TAF | SSD |
|---|
One course of 12 ECTS or two courses of 6 ECTS chosen from the following three| Modules | Credits | TAF | SSD |
|---|
| Modules | Credits | TAF | SSD |
|---|
One course chosen from the following two| Modules | Credits | TAF | SSD |
|---|
One course of 12 ECTS or two courses of 6 ECTS chosen from the following three| 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 (2012/2013)
Teaching code
4S02751
Credits
12
Language
Italian
Scientific Disciplinary Sector (SSD)
INF/01 - INFORMATICS
The teaching is organized as follows:
Teoria
Laboratorio
Learning outcomes
Module: theory.
-------
Introduction to informatics.
Study the principles of programming
Basic techniques for the analysis and solution of the problems
Introduction to the methods for the evaluation of correctness and efficiency of algorithms.
Module: laboratory.
-------
Knowledge of a programming language
Developing of projects of small or medium size.
Application of the techniques of algorithms evaluation.
Program
Module: theory.
-------
Introduction to Computing Science.
Part I - problems, algorithms and programs.
- Basics: problem, specifics, algorithm; abstract machine, compiler and interpreter; programming languages.
- Introduction to the programming language.
- Elementary programming: basic instructions and development 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.
- Introduction to graphs and other subjects.
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 and Vectors: implementation, operations and algorithms.
- Dynamic sequences: abstract definition and implementation; basic operations.
- Trees. Abstract definition and implementation. Basic operation. Binary research trees.
- Introduction to graphs.
The styles of programming.
Imperative Programming and basics of Object Oriented Programming
-------------------
Module: 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 management.
Bibliography
| Activity | Author | Title | Publishing house | Year | ISBN | Notes |
|---|---|---|---|---|---|---|
| Teoria | Bertossi, Alan e Montresor, Alberto | Algoritmi e strutture di dati (Edizione 3) | Città Studi Edizioni, De Agostini Scuola | 2014 | 978-8-825-17395-6 | |
| Teoria | Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein | Introduction to Algorithms (Edizione 3) | MIT Press | 2009 | 978-0-262-53305-8 | Testo di riferimento e consultazione |
| Teoria | Savitch, Walter e Carrano, Frank M. | Programmazione con Java (Edizione 1) | Pearson Prentice Hall Italia | 2010 | 9-788871-926148 |
Examination Methods
The exam is unique and consists in two parts:
- a first written test concerning the topics of the course and the laboratory activity.
- the final part (the admission is subject to the approval of the first one) consisting in general questions, exercises and a discussion on the examination paper, the lab activity.
The final written exam can be replaced by tests that take place during the teaching periods.
