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 Bioinformatica - 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. 2017/2018
Modules | Credits | TAF | SSD |
---|
3° Year activated in the A.Y. 2018/2019
Modules | Credits | TAF | SSD |
---|
One course to be chosen among the following
2 courses to be chosen among the following
Modules | Credits | TAF | SSD |
---|
Modules | Credits | TAF | SSD |
---|
Modules | Credits | TAF | SSD |
---|
One course to be chosen among the following
2 courses to be chosen among the following
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.
Introduction to Programming - PROGRAMMAZIONE PER BIOINFORMATICA (2016/2017)
Teaching code
4S00016
Teacher
Credits
6
Language
Italian
Scientific Disciplinary Sector (SSD)
INF/01 - INFORMATICS
Period
II sem., I sem.
Learning outcomes
The aim of this course is introducing the students to structured programming by using the C programming language. The course provides students the basic capabilities for writing simple programs in C.
Program
Introduction to Computers and programming
Algorithms and structured programming
Flow control structures
Functions and the concept of abstracion
Arrays and Pointers
Characters and Strings
Formatted Input/Output
Structures, Unions, Bit Manipulations, Enumerations
Lists, trees, stacks and queues and their implementation.
File Processing
Preprocessor
Author | Title | Publishing house | Year | ISBN | Notes |
---|---|---|---|---|---|
P.Deitel & H.Deitel | Il Linguaggio C, Fondamenti e tecniche di programmazione | Pearson | 2013 | 8871929373 |
Examination Methods
Written exam:
The examination consists of two tests:
- Test n1
multiple choice test (20 questions 1 point for each correct answer, 0 points for no response is given, -1 for each wrong answer. N1 The test is passed if the sum of the points and 'GREATER THAN OR EQUAL to 10.
Getting through of THE TEST n1 is the necessary and sufficient condition to be able to withstand the test n2.
The vote obtained in the test N1 does not contribute to the final grade.
- Test n2
Written standard exam: open questions. For each question is assigned the maximum score of 6 points.