|Politecnico di Torino|
|Academic Year 2012/13|
|12BHDLZ, 12BHDLN, 12BHDLS, 12BHDLX, 12BHDMA, 12BHDMB, 12BHDMC, 12BHDMH, 12BHDMK, 12BHDMN, 12BHDMO, 12BHDMQ, 12BHDNL, 12BHDNM, 12BHDNX, 12BHDNZ, 12BHDOA, 12BHDOD, 12BHDPC, 12BHDPI, 12BHDPL, 12BHDQR
1st degree and Bachelor-level of the Bologna process in Aerospace Engineering - Torino
1st degree and Bachelor-level of the Bologna process in Automotive Engineering - Torino
1st degree and Bachelor-level of the Bologna process in Materials Engineering - Torino
This course, mandatory for all the students, has a twofold objective: on one hand, to introduce the student to the issues related to computer science, in particular from the cultural standpoint, but also from the technological one. On the other hand, the course aims at teaching the use of computer programming as a way to solve real-life problems.
Expected learning outcomes
The student must acquire two fundamental types of knowledge; the solution of realistic problems through programs implemented using a programming language and to be executed on a computer; the understanding of the quantitative aspects of computer science such as performance, computational power, representation of information, computer architecture. These skills will be applied to the solution of practical problems.
Prerequisites / Assumed knowledge
The main prerequisites are the knowledge of some basic notions of Calculus.
NUMERICAL AND NON-NUMERICAL REPRESENTATIONS (8 HRS)
-Operations with pure binary numbers: Addition, Subtraction, Overflow.
-Sign and Magnitude: Representation
-Two's complement: Representation, Addition, Subtraction, Overfloww, Shift
-Real Numbers (Fixed and Floating Point)
-Fixed Point and Floating Point (exponential representation).
-Characters encoding (ASCII, UNICODE)
-Image encoding (raster, vectorial)
-Sound encoding (sampling)
-Movies encoding (differential)
-Compression and error control
BOOLEAN ALGEBRA (2 HRS]
-AND, OR, NOT operators and Boolean expressions
COMPUTER ARCHITECTURE (6 HRS)
-Von Neumann model (Program Memory, Control Unit, Operating Unit)
-CPU (execution speed) and cache
-PC architecture (graphical devices, disks, buses)
-Data transmission (bottleneck, shared band, asimmetric speeds)
SOFTWARE ARCHITECTURE (4 HRS)
-Machine language, assembler, high level languages
-Language translation, libraries and program execution
-Operating System (task management)
PROBLEM SOLVING AND ALGORITHMS (4 HRS)
-Flow charts, pseudo-code
-Problem solving and program writing
C LANGUAGE (36 HRS]
-Input/output operations (printf and scanf).
-Control-Flow structures (iterative and conditional).
-Arrays and multidimensional arrays (of integers, reals and characters).
-Functions and calls (by reference, by value, pointers).
-Command line arguments (argc and argv).
-Dynamic memory allocation.
The course includes 20 hours of lab, in which the topics covered in the classes will be implemented as C programs.
Texts, readings, handouts and other learning resources
-Handouts of class material.
-H.M.Deitel e P.J.Deitel, 'C: How to Program', 6th edition, Prentice-Hall
Assessment and grading criteria
The exam consists of a written test and of an oral test, both mandatory. The written test aims at assessing the students' knowledge of the theoretical aspects of the course (through numerical exercises or open-answer questions) and the programming skills (through the writing on paper of a C program that implements the solution of a practical problem). The oral test consists of a discussion about the written test and may cover any of the topic covered in the course.
Programma definitivo per l'A.A.2012/13