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.

A.A. 2010/2011

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
I semestre Oct 4, 2010 Jan 31, 2011
II semestre Mar 1, 2011 Jun 15, 2011
Exam sessions
Session From To
Sessione straordinaria Feb 1, 2011 Feb 28, 2011
Sessione estiva Jun 16, 2011 Jul 29, 2011
Sessione autunnale Sep 1, 2011 Sep 30, 2011
Degree sessions
Session From To
Sessione autunnale Oct 20, 2010 Oct 20, 2010
Sessione straordinaria Dec 14, 2010 Dec 14, 2010
Sessione invernale Mar 23, 2011 Mar 23, 2011
Sessione estiva Jul 18, 2011 Jul 18, 2011
Holidays
Period From To
All Saints Nov 1, 2010 Nov 1, 2010
National holiday Dec 8, 2010 Dec 8, 2010
Christmas holidays Dec 22, 2010 Jan 6, 2011
Easter holidays Apr 22, 2011 Apr 26, 2011
National holiday Apr 25, 2011 Apr 25, 2011
Labour Day May 1, 2011 May 1, 2011
Local holiday May 21, 2011 May 21, 2011
National holiday Jun 2, 2011 Jun 2, 2011
Summer holidays Aug 8, 2011 Aug 15, 2011

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

B C D F G M P S T V Z

Belussi Alberto

alberto.belussi@univr.it +39 045 802 7980

Bombieri Nicola

nicola.bombieri@univr.it +39 045 802 7094

Cristani Matteo

matteo.cristani@univr.it 045 802 7983

Di Pierro Alessandra

alessandra.dipierro@univr.it +39 045 802 7971

Drago Nicola

nicola.drago@univr.it 045 802 7081

Ferro Ruggero

ruggero.ferro@univr.it 045 802 7909

Fiorini Paolo

paolo.fiorini@univr.it 045 802 7963

Fummi Franco

franco.fummi@univr.it 045 802 7994

Giacobazzi Roberto

roberto.giacobazzi@univr.it +39 045 802 7995

Gregorio Enrico

Enrico.Gregorio@univr.it 045 802 7937

Guerriero Massimo

massimo.guerriero@univr.it

Mariotto Gino

gino.mariotto@univr.it +39 045 8027031

Masini Andrea

andrea.masini@univr.it 045 802 7922

Menegaz Gloria

gloria.menegaz@univr.it +39 045 802 7024

Merro Massimo

massimo.merro@univr.it 045 802 7992

Monti Francesca

francesca.monti@univr.it 045 802 7910

Morato Laura Maria

laura.morato@univr.it 045 802 7904

Pravadelli Graziano

graziano.pravadelli@univr.it +39 045 802 7081

Segala Roberto

roberto.segala@univr.it 045 802 7997

Todorov Velitchko

velitchko.todorov@univr.it

Venturin Manolo

Vigano' Luca

luca.vigano@univr.it

Zoccante Sergio

sergiozoccante@tin.it

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.

ModulesCreditsTAFSSD
12
B
(INF/01)
6
C
(FIS/01)
Un insegnamento a scelta tra i seguenti:
6
B
(INF/01)
6
B
(ING-INF/05)
12
B
(ING-INF/05)
ModulesCreditsTAFSSD
12
B
(INF/01)
Un insegnamento a scelta tra i seguenti:
Prova finale
6
E
(-)

2° Year

ModulesCreditsTAFSSD
12
B
(INF/01)
6
C
(FIS/01)
Un insegnamento a scelta tra i seguenti:
6
B
(INF/01)
6
B
(ING-INF/05)
12
B
(ING-INF/05)

3° Year

ModulesCreditsTAFSSD
12
B
(INF/01)
Un insegnamento a scelta tra i seguenti:
Prova finale
6
E
(-)

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.




SPlacements in companies, public or private institutions and professional associations

Teaching code

4S00019

Credits

12

Coordinatore

Graziano Pravadelli

Scientific Disciplinary Sector (SSD)

ING-INF/05 - INFORMATION PROCESSING SYSTEMS

Language

Italian

The teaching is organized as follows:

Teoria

Credits

9

Period

II semestre, I semestre

Academic staff

Graziano Pravadelli

Laboratorio [Laboratorio 1]

Credits

3

Period

II semestre

Academic staff

Francesco Stefanni

Laboratorio [Laboratorio 2]

Credits

3

Period

II semestre

Academic staff

Francesco Stefanni

???OrarioLezioni???

Learning outcomes

The course introduces to operating system design, with particular regards to concepts related to the architecture of an operating system, and to the management and synchronization of processes and resources.

Program

Theory:
-------
* Introduction: Evolution and role of the operating system. Architectural concepts. Organization and functionality of an operating system.

* Process Management: Processes. Process status. Context switch. Process creation and termination. Thread. User-level threads and kernel-level threads. Process cooperation and communication: shared memory, messagges. Direct and indirect communication.

* Scheduling: CPU and I/O burst model. Long term, short term and medium term scheduling. Preemption. Scheduling criteria. Scheduling algorithm: FCFS, SJF, priority-based, RR, HRRN, multiple queues with and without feedback. Algorithm evaluation: deterministic and probabilistic models, simulation.

* Process synchronization: data coherency, atomic operations. Critical sections. SW approaches for mutual exclusion: Peterson and Dekker's algorithms, baker's algorithm. HW for mutual exclusion: test and set, swap. Synchronization constructs: semaphores, mutex, monitor.

* Deadlock: Deadlock conditions. Resource allocation graph. Deadlock prevention. Deadlock avoidance. Banker's algorithm. Deadlock detection e recovery.

* Memory management: Main memory. Logical and physical addressing. Relocation, address binding. Swapping. Memory allocation. Internal and external fragmentation. Paging. HW for paging: TLB. Page table. Multi-level paging. Segmentation. Segment table. Segmentation with paging.

* Virtual memory: Paging on demand. Page fault management. Page substitution algorithms: FIFO, optimal, LRU, LRU approximations. Page buffering. Frame allocation: local and global allocation. Thrashing. Working set model. Page fault frequency.

* Secondary memory. Logical and physical structure of disks. Latency time. Disk scheduling algorithms: FCFS, SSTF, SCAN, C-SCAN, LOOK, C-LOOK. I/O subsystem: I/O Hardware. I/O techniques: programmed I/O, interrupt, DMA. Device driver and application interface. I/O kernel services: scheduling, buffering, caching, spooling.

*File System: file, attributes and related operation. File types. Sequential and direct access. Directory structure. Access permissions and modes. Consistency semantics. File system structure. File system mounting. Allocation techniques: adjacent, linked, indexed. Free space management: bit vector, lists. Directory implementation: linear list, hash table.

Laboratory:
------------
* Shell programming in Unix/Linux.
* Introduction to the system programming in Unix/Linux.
* System calls for I/O.
* System calls for process management.
* System calls and techniques for inter-process communication and synchronization (pipe, fifo, message queue, share memory, semaphores, ...).
* Thread programming.

Examination Methods

Theory:
-------
The final exam consists of a written test containing questions and exercises.

Laboratory:
-----------
The exam can be taken in two modes: oral or written.

Oral mode:
During the course, students must solve 4 homeworks and provide the corresponding solutions within deadlines defined by the theacher. Then, at the end of the course, on the second half of June, each student must present orally the provided solutions to the theacher.
The exam can be taken in oral mode only on the second half of June.
The observance of deadlines is mandatory. Students that miss the deadline cannot take the exam in the oral mode.

Written mode:
The exam consists of solving some exercises related to system programming by means of shell scripts and/or C programs.

Total grade
-----------
The total grade (thery+laboratory) is given by:
theory_grade*0.5 + laboratory_grade*0.5.

Bibliografia

Reference texts
Activity Author Title Publishing house Year ISBN Notes
Teoria Andrew S. Tanenbaum I moderni sistemi operativi (Edizione 3) Addison Wesley 2009 8871925408
Teoria Dhananjay M. Dhamdhere Sistemi Operativi (Edizione 1) McGraw-Hill 2010 9788838664878
Teoria A. Silberschatz - P.B. Galvin - G. Gagne Sistemi Operativi. Concetti ed esempi. (Edizione 8) Pearson Paravia Bruno Mondadori 2009 978-88-7192-569-1 Testo di riferimento

Teaching materials

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.

Graduation

List of theses and work experience proposals

theses proposals Research area
Analisi e percezione dei segnali biometrici per l'interazione con robot AI, Robotics & Automatic Control - AI, Robotics & Automatic Control
Integrazione del simulatore del robot Nao con Oculus Rift AI, Robotics & Automatic Control - AI, Robotics & Automatic Control
Domain Adaptation Computer Science and Informatics: Informatics and information systems, computer science, scientific computing, intelligent systems - Computer graphics, computer vision, multi media, computer games
Domain Adaptation Computer Science and Informatics: Informatics and information systems, computer science, scientific computing, intelligent systems - Machine learning, statistical data processing and applications using signal processing (e.g. speech, image, video)
BS or MS theses in automated reasoning Computing Methodologies - ARTIFICIAL INTELLIGENCE
Domain Adaptation Computing Methodologies - IMAGE PROCESSING AND COMPUTER VISION
Domain Adaptation Computing methodologies - Machine learning
Dati geografici Information Systems - INFORMATION SYSTEMS APPLICATIONS
Analisi e percezione dei segnali biometrici per l'interazione con robot Robotics - Robotics
Integrazione del simulatore del robot Nao con Oculus Rift Robotics - Robotics
BS or MS theses in automated reasoning Theory of computation - Logic
BS or MS theses in automated reasoning Theory of computation - Semantics and reasoning
Proposte di tesi/collaborazione/stage in Intelligenza Artificiale Applicata Various topics
Proposte di Tesi/Stage/Progetto nell'ambito delle basi di dati/sistemi informativi Various topics

Gestione carriere


Area riservata studenti


Attendance

As stated in point 25 of the Teaching Regulations for the A.Y. 2021/2022, attendance at the course of study is not mandatory.
Please refer to the Crisis Unit's latest updates for the mode of teaching.

Further services

I servizi e le attività di orientamento sono pensati per fornire alle future matricole gli strumenti e le informazioni che consentano loro di compiere una scelta consapevole del corso di studi universitario.