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

A.A. 2024/2025 A.A. 2023/2024 A.A. 2022/2023 A.A. 2021/2022 A.A. 2020/2021 A.A. 2019/2020 A.A. 2018/2019 A.A. 2017/2018 A.A. 2016/2017 A.A. 2015/2016 A.A. 2014/2015 A.A. 2013/2014 A.A. 2012/2013 A.A. 2011/2012 A.A. 2010/2011 A.A. 2009/2010

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/2026

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.

CURRICULUM TIPO:

1° Year 

ModulesCreditsTAFSSD
12
A
MAT/02 ,MAT/03
12
A
MAT/05
6
A
MAT/08
12
A
FIS/01
6
B
MAT/01
12
A
INF/01

2° Year   activated in the A.Y. 2022/2023

ModulesCreditsTAFSSD
6
A
MAT/02
12
B
MAT/05
6
B
MAT/08
6
B
MAT/03
6
C
SECS-P/01
6
C
SECS-P/01
9
B
MAT/06
6
B
MAT/05
6
E
L-LIN/12

3° Year   activated in the A.Y. 2023/2024

ModulesCreditsTAFSSD
6
C
SECS-P/05
9
C
SECS-S/06
6
B
MAT/08
6
B
MAT/09
6
B
MAT/06
Final exam
6
E
-
activated in the A.Y. 2022/2023
ModulesCreditsTAFSSD
6
A
MAT/02
12
B
MAT/05
6
B
MAT/08
6
B
MAT/03
6
C
SECS-P/01
6
C
SECS-P/01
9
B
MAT/06
6
B
MAT/05
6
E
L-LIN/12
activated in the A.Y. 2023/2024
ModulesCreditsTAFSSD
6
C
SECS-P/05
9
C
SECS-S/06
6
B
MAT/08
6
B
MAT/09
6
B
MAT/06
Final exam
6
E
-
Modules Credits TAF SSD
Between the years: 1°- 2°- 3°
Further activities
6
F
-
Between the years: 1°- 2°- 3°
12
D
-

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.

A Basic activities
B Characterizing activities
C Related or complementary activities
D Activities to be chosen by the student
E Final examination
F Other training activities
S Placements in companies, public or private institutions and professional associations

Computer Programming with Laboratory  (2021/2022)

Teaching code

4S02751

Academic staff

Ugo Solitro, Matteo Mantovani

Coordinator

Ugo Solitro

Credits

12

Language

Italian

Scientific Disciplinary Sector (SSD)

INF/01 - INFORMATICS

Period

Primo semestre, Secondo semestre

Lessons timetable MoodleMoodle Seminars 0

Learning outcomes

This course proposes providing the fundamentals skills in order to analyze and resolve problems by means of developing programs. The general objectives of this module are - the knowledge of the principles of programming and of programming languages, - the mastery of fundamental techniques for analyzing problems and developing their algorithmic solutions, - the introduction to the methods for the evaluation of correctness and efficiency of algorithms. In the laboratory, we will practice the above principles by means of a programming activity.

Program

CONTENTS

INTRODUCTION

- Problems and Solutions.
- Models of Computations: abstract machine, compiler and interpreter.
- Programming languages: formal languages, compiler, interpreter.
- Laboratory: introduction to linux and to the developing environment.

PART I - Problems, algorithms and programs.

- Imperative programming
- Elementary of programming: basic instructions and development of simple programs; variables, expressions and assignment.
- Data types. The general concept of data type: characterisation and data representation. Abstract Data Types.
- Primitive data types: characterisation, use and related problems.
- Structured data types: array, record, file, pointer, string and other data structures.
- Program structure. Fundamental instructions. Sub-programs: structure, parameters and visibility. Recursion.
- Object Oriented Programming.
- Basics of objects: classes, objects, attributes, constructors, modifiers.
- Advanced data structures: representation of sequences, vector and matrices; inductive and dynamic data structures; introduction to lists, trees and graphs.

PART II - Analysis of Algorithms

- Correctness: termination, logic properties; methods for the correctness verification.
- Efficiency of algorithms.
- 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.
- Amortised analysis.
- Study of fundamental examples.
- Sequences: static and dynamic implementation and algorithms.
- Research and Sorting Algorithms: basic search, binary search, insertion and selection sort, merge sort, quick sort.
- 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 algorithms on graphs.

PRACTICAL PART

The practical activities use the laboratory and consist of learning the programming language in the laboratory and solving problems by applying the principles developed in class.

Bibliography

Vai alla bibliografia
Visualizza la bibliografia con Leganto, strumento che il Sistema Bibliotecario mette a disposizione per recuperare i testi in programma d'esame in modo semplice e innovativo.

Examination Methods

The final exam consists of an oral exam: in order to be admitted to the final exam, the student must pass a preliminary written test.
The written test can be partially replaced by ongoing tests and activities.

The assessment methods could change according to the evolution of the general health situation and the academic rules.

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