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.

Academic calendar

The academic calendar shows the deadlines and scheduled events that are relevant to students, teaching and technical-administrative staff of the University. Public holidays and University closures are also indicated. The academic year normally begins on 1 October each year and ends on 30 September of the following year.

Academic calendar

Course calendar

The Academic Calendar sets out the degree programme lecture and exam timetables, as well as the relevant university closure dates..

Definition of lesson periods
Period From To
1st Semester Oct 1, 2009 Jan 31, 2010
2nd Semester Mar 1, 2010 Jun 15, 2010
Exam sessions
Session From To
Sessione straordinaria Feb 1, 2010 Feb 28, 2010
Sessione estiva Jun 16, 2010 Jul 31, 2010
Sessione autunnale Sep 1, 2010 Sep 30, 2010
Degree sessions
Session From To
Sessione autunnale Oct 14, 2009 Oct 14, 2009
Sessione straordinaria Dec 16, 2009 Dec 16, 2009
Sessione invernale Mar 10, 2010 Mar 10, 2010
Sessione estiva Jul 21, 2010 Jul 21, 2010
Period From To
Festa di Ognissanti Nov 1, 2009 Nov 1, 2009
Festa dell'Immacolata Concezione Dec 8, 2009 Dec 8, 2009
Vacanze Natalizie Dec 21, 2009 Jan 6, 2010
Vacanze Pasquali Apr 2, 2010 Apr 6, 2010
Festa della Liberazione Apr 25, 2010 Apr 25, 2010
Festa del Lavoro May 1, 2010 May 1, 2010
Festa del Santo Patrono May 21, 2010 May 21, 2010
Festa della Repubblica Jun 2, 2010 Jun 2, 2010
Vacanze Estive Aug 9, 2010 Aug 15, 2010

Exam calendar

Exam dates and rounds are managed by the relevant Science and Engineering Teaching and Student Services Unit.
To view all the exam sessions available, please use the Exam dashboard on ESSE3.
If you forgot your login details or have problems logging in, please contact the relevant IT HelpDesk, or check the login details recovery web page.

Exam calendar

Should you have any doubts or questions, please check the Enrolment FAQs

Academic staff


Assfalg Michael +39 045 802 7949

Bassi Roberto 045 802 7916; Lab: 045 802 7915

Bellin Gianluigi +39 045 802 7969

Bettinelli Marco Giovanni 045 802 7902

Bossi Alessandra Maria 045 802 7946 (Studio) - 045 802 7833 (Laboratorio)

Buffelli Mario Rosario +39 0458027268
foto,  March 16, 2015

Cecchi Franco 045 802 7964 - 7965

Crimi Massimo 045 802 7924; Lab: 045 802 7050

Delledonne Massimo 045 802 7962; Lab: 045 802 7058

Dominici Paola 045 802 7966; Lab: 045 802 7956-7086

Drago Nicola 045 802 7081

Furini Antonella 045 802 7950; Lab: 045 802 7043

Giorgetti Alejandro 045 802 7982

Gobbi Bruno

Lampis Silvia 045 802 7095

Marastoni Corrado

Molesini Barbara 045 802 7550

Molinari Henriette 045 802 7901; Lab: 045 802 7906
Foto,  April 9, 2014

Monaco Ugo Luigi 045 802 7903; Lab: 045 802 7907 - 045 802 7082

Perduca Massimiliano +39 045 802 7984

Romeo Alessandro +39 045 802 7974-7936; Lab: +39 045 802 7808

Spena Angelo 045 683 5623
Foto personale,  July 18, 2012

Vallini Giovanni 045 802 7098; studio dottorandi: 045 802 7095

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 enrolment year.

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.

S Placements in companies, public or private institutions and professional associations

Teaching code



Nicola Drago


Nicola Drago





Scientific Disciplinary Sector (SSD)



1st Semester dal Oct 1, 2009 al Jan 31, 2010.

Learning outcomes

The course aims to introduce the fundamentals of IT, of computers and their operation.
The course will explain the rudiments of basic programming. After completing this course the student knows the concepts of algorithm, program, information, know at the elementary level hardware structure of a computer, the structure of an operating system, the structure of a network, the structure of the Internet.
And 'able to read simple Programi written in C/C++ and is able to write simple programs if driven into the C/C++ language.
The course is not treated object-oriented programming.


Algorithms and Programs: Concepts to know and be able to solve a problem, interpreting a language, simple and complex problem, breaking down a problem into subproblems algorithm. Ownership of a performer.

Programming Languages: Syntax and semantic categories of instructions (input / output, arithmetic / logic control), operators, major constructs (if-then-else), variables and types of data elements.

Elements of information theory: Conditions for existence of information, concept code, syntactic semantic and pragmatic information, measurement information and the concept of bits, bytes and its multiples, the definition of entropy, binary data, representation of numbers under other than 10. Hardware structure of a computer: Machine Von Neumannm structure of the CPU (internal block diagram, with execution of an instruction fetch and execute phases), memory (structure, main memory and mass memory electronic, optical, magnetic, magneto- optic, flash, comparison in terms of access speed, capacity, volatility, cost per bit sequential access memories, random, mixed associations, block structure of an electronic memory, memory hierarchy), input / output ( hard disk, CD, CD-R, keyboard, video, mouse, printer interfacing the I / O mechanism breaks).

Operating Systems: Objectives, functions, and main components. Process management (queues ready, running, waiting), memory (cache, virtual memory), management of devices (interaction with heterogeneous devices, use of drivers), file system management (logical structure of a file system).

Computer Networks: Local networks and geographical links to circuit switching and packet switching, transmission ISDN, DSL, ATM, a modem function, topology (star, ring, bus) and communication (token ring, CSMA / CD) in a local network, network components (hubs, swithc, bridges, routers, gateways), IP address, symbolic function of the DNS.

The course is carried out in 42 hours of lectures divided into 14 classes of three hours each, and six hours laboratory divided into 3 sessions of 2 hours each. The theory lessons are deliberately dense and richer in content than stated in the training objectives. This is to address the fundamental issues with the highest number of examples as possible and to provide interested students the tools to more personal insights. The lessons of the laboratory is in the resolution of simple exercises on the Linux filesystem.

Examination Methods

The exam is oral Informatics.
For admission consideration, students must pass a written tutorial that consists of 2-3 hours in test questions and multiple answers (each question can have more true answers and wrong answers penalize the score) and 2 / 3 open questions on the application of theory and on the laboratory. The tutorial written is passed if the student gets a score of at least 18/30.

At the exam the student may bring only pens and pencils (book or other script arent admitted).

At the oral exam the student may decide to exercise voting record or written to be reviewed by interview. In this case the final grade will be based purely on examination interview without taking any account of the outcome of the exercise in writing.

It 'may compel the interview of the teacher.

Type D and Type F activities

Modules not yet included

Career prospects

Module/Programme news

News for students

There you will find information, resources and services useful during your time at the University (Student’s exam record, your study plan on ESSE3, Distance Learning courses, university email account, office forms, administrative procedures, etc.). You can log into MyUnivr with your GIA login details.


For schedules, administrative requirements and notices on graduation sessions, please refer to the Graduation Sessions - Science and Engineering service.

List of theses and work experience proposals

theses proposals Research area
Studio delle proprietà di luminescenza di lantanidi in matrici proteiche Synthetic Chemistry and Materials: Materials synthesis, structure-properties relations, functional and advanced materials, molecular architecture, organic chemistry - Colloid chemistry
Multifunctional organic-inorganic hybrid nanomaterials for applications in Biotechnology and Green Chemistry Synthetic Chemistry and Materials: Materials synthesis, structure-properties relations, functional and advanced materials, molecular architecture, organic chemistry - New materials: oxides, alloys, composite, organic-inorganic hybrid, nanoparticles
Stampa 3D di nanocompositi polimerici luminescenti per applicazioni in Nanomedicina Synthetic Chemistry and Materials: Materials synthesis, structure-properties relations, functional and advanced materials, molecular architecture, organic chemistry - New materials: oxides, alloys, composite, organic-inorganic hybrid, nanoparticles
Dinamiche della metilazione del DNA e loro contributo durante il processo di maturazione della bacca di vite. Various topics
Risposte trascrittomiche a sollecitazioni ambientali in vite Various topics
Studio delle basi genomico-funzionali del processo di embriogenesi somatica in vite Various topics


As stated in point 25 of the Teaching Regulations for the A.Y. 2021/2022, attendance is not mandatory. However, professors may require students to attend lectures for a minimum of hours in order to be able to take the module exam, in which case the methods that will be used to check attendance will be explained at the beginning of the module. 
Please refer to the Crisis Unit's latest updates for the mode of teaching.

Career management

Area riservata studenti