Faculty Home topBanner_en.jpg
 
| where to find uswhere to find us | | telephone e-mailtelephone e-mail | |   | Italiano English ? |
map map
 
*Education *People *Collegial bodies *Offices and service facilities
*News & Events *News *Seminars *Libraries
University Home 
Faculty Home 
 
Didactic offer
*
 
 
*
*
 
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
|
 

Degree in Computer Science

Programming I (2012/2013)

Course code 4S02723  
Credits 12  
Coordinator Nicola Fausto Spoto
Disciplinary sector INF/01 - Computing
Teaching language Italian
Web page http://profs.sci.univr.it/~spoto/programmazione_I/2012-2013.html
Links
*
*


Teaching is organised as follows:

Activity Credits Period Academic staff
Teoria 8 II semestre, I semestre Nicola Fausto Spoto
Laboratorio 4 II semestre, I semestre Sara Migliorini

Lecture timetable

I semestre
Activity day Time Type Place Note
Teoria Tuesday 8:30 AM - 10:30 AM lesson Lecture theatre "Gino Tessari"  
Teoria Thursday 12:30 PM - 1:30 PM lesson Lecture theatre "Gino Tessari"  
Laboratorio Monday 4:30 PM - 6:30 PM laboratorio Didactic workshop Delta  
Laboratorio Thursday 4:30 PM - 6:30 PM laboratorio Didactic workshop Delta  

II semestre
Activity day Time Type Place Note
Teoria Monday 11:30 AM - 1:30 PM lesson Lecture theatre A  
Teoria Wednesday 8:30 AM - 10:30 AM lesson Lecture theatre "Gino Tessari"  
Laboratorio Tuesday 2:30 PM - 5:30 PM laboratorio Didactic workshop Delta  

Educational objectives

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.

Exam methods

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. Students must reach at least 18 in both parts in order to successfully pass the exam. The 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 6 examination periods 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 on students' past performance (Art. 2 del D.M. 31/10/2007, n. 544)

Data from AA 2012/2013 are not available yet