Programming I (2014/2015)



Course code
4S02723
Credits
12
Coordinator
Nicola Bombieri
Academic sector
INF/01 - INFORMATICS
Language of instruction
Italian
Teaching is organised as follows:
Activity Credits Period Academic staff Timetable
Teoria 8 II sem., I sem. Nicola Bombieri
Laboratorio [Laboratorio II turno M-Z] 4 II sem., I sem. Vincenzo Bonnici
Laboratorio [Laboratorio I turno A-I] 4 II sem., I sem. Vincenzo Bonnici
Maurizio Boscaini

Lesson timetable

I sem.
Activity Day Time Type Place Note
Teoria Tuesday 10:30 AM - 12:30 PM lesson Lecture Hall Gino Tessari  
Teoria Thursday 2:30 PM - 3:30 PM lesson Lecture Hall A  
Laboratorio [Laboratorio I turno A-I] Thursday 3:30 PM - 5:30 PM lesson Laboratory Delta  
Laboratorio [Laboratorio II turno M-Z] Friday 4:30 PM - 6:30 PM lesson Laboratory Delta  
II sem.
Activity Day Time Type Place Note
Teoria Wednesday 2:30 PM - 4:30 PM lesson Lecture Hall A  
Teoria Thursday 8:30 AM - 10:30 AM lesson Lecture Hall Gino Tessari  
Laboratorio [Laboratorio I turno A-I] Monday 3:30 PM - 6:30 PM laboratorio Laboratory Delta  
Laboratorio [Laboratorio II turno M-Z] Friday 10:30 AM - 1:30 PM laboratorio Laboratory Delta  

Learning outcomes

This course provides students with the basic abilities needed to write simple programs in the C programming language. They will learn how to organize a program in that imperative structured language and how to use it to implement simple algorithms. The relationship between the C language and the underlying machine is highlighted. The concept of recursion is put in evidence, as well as the implementation of simple data structures, both recursive and non-recursive.

Syllabus

Von Neumann machines. Binary representation of numbers, characters, strings and commands. Binary, octal, hexadecimal numbers. Structure of a C program. Use of a C compiler. Expressions and commands. Structured programming. Assignments, conditionals and loops. Arrays. Pointers. Function calls. Activation stack. Call by value and call by reference. Structures. The C standard library. Recursion. Recursive data structures. Lists.

Assessment methods and criteria

The exam, unified with the Laboratory module, consists in two parts, that will take place around February and June. The note of each part is between 0 and 30. The final global note is the composition of the notes of the two parts. Students who do not pass these partial exams can try again in the normal 4 examinations scattered around the year, starting from June. Those exams are on the total program of the course. Exams (partial as well as total) verify the ability in writing simple programs, on paper and without the use of a computer. The important point is the ability to organize algorithms and data structures and translate them into the C language with no significant syntactical errors.

Reference books
Activity Author Title Publisher Year ISBN Note
Teoria Stephen G. Kochan Programmare in C (Edizione 3) Pearson 2011 9788871926605

Statistics about transparency requirements (Attuazione Art. 2 del D.M. 31/10/2007, n. 544)

Statistics
Outcomes Exams Outcomes Percentages Average Standard Deviation
Positive 43.54% 25 3
Rejected 25.80%
Absent 19.67%
Ritirati 10.96%
Canceled --
Distribuzione degli esiti positivi
18 19 20 21 22 23 24 25 26 27 28 29 30 30 e Lode
5.9% 4.4% 6.6% 7.4% 7.4% 6.6% 11.1% 4.4% 13.3% 9.6% 5.1% 5.9% 6.6% 5.1%

Data from AA 2014/2015 based on 310 students. I valori in percentuale sono arrotondati al numero intero più vicino.