1. Departament of Automatics Superior Polytechnic School
COURSE “PROGRAMMING”
GRADUATE IN ENGINEERING OF TELECOMMUNICATION TECHNOLOGIES
GRADUATE IN ENGINEERING OF TELECOMMUNICATION SYSTEMS
GRADUATE IN ENGINEERING OF COMMUNICATION ELECTRONICS
GRADUATE IN TELEMATICS ENGINEERING
Year 1, Semester 2
Departament of Automatics
Superior Polytechnic School
University of Alcalá
Web page:

2. TEACHERS OF THEORY CLASSES MAIN RESPONSIBLE FOR THE COURSE:
ANTONIO GUERRERO BAQUERO
Theory Groups: 1A – 1B – 1C – 1D – 1E)
Room: E
DAVID FERNANDEZ LLORCA
Theory Groups: 1F – 1G
Despacho: E
MAIN RESPONSIBLE FOR THE COURSE:

3. TEACHERS OF LABORATORY
IGNACIO PARRA ALONSO Grupos de laboratorio: C1, B2. Despacho: E338      MELQUIADES CARBAJO MARTÍN Grupos de laboratorio: A1 Despacho: N242      IVÁN GARCÍA DAZA Grupos de laboratorio: G2 Despacho: E336      JAVIER ALONSO RUIZ Grupos de laboratorio: C2, E1 Despacho: E331       CARLOTA SALINAS MALDONADO Grupos de laboratorio: D1, D2 Despacho: E-202      RAUL QUINTERO MINGUEZ Grupos de laboratorio: B3, F1 Despacho: E-202      RUBEN IZQUIERDO GONZALO Grupos de laboratorio: G1, G3 Despacho: E-202      CARLOS FERNANDEZ LÓPEZ Grupos de laboratorio: A2, B1 (hasta marzo) Despacho: E-202       JAVIER LORENZO DÍAZ Grupos de laboratorio: A2, B1 (desde marzo) Despacho: E-202      

4. OBJECTIVES OF THE COURSE
Study in depth the structured programming using the C programming language, applied both to Windows and Unix/Linux operating systems.
PROGRAMME OF THE COURSE
REVIEW OF BASIC CONCEPTS ABOUT POINTERS
ADVANCED USE OF POINTERS
ADVANCED MANAGEMENT OF FUNCTIONS
CREATION AND MANIPULATION OF FILES
DYNAMIC DATA STRUCTURES
ALGORITHMS

5. THEORY CLASSES
2 hours per week, 14 weeks. During the two initial weeks there are 2+2 hours per week, with no laboratory classes (from 23-January to 3-February).
Attendance is not compulsory (no student list is checked).
Use of presentations with computer and blackboard support.
The presentations can be downloaded and printed from the web of the course.
Very convenient the use of some auxiliary book at home, from the ones included in the recommended bibliography.
During the course some aditional materials will be published (prototypes of standard functions, solved exercises, marks of partial examinations, etc.) in the web page of the course.

6. LABORATORY CLASES
2 hours per week, 12 weeks. Classes start on Monday 5-February, two weeks after the start of theory classes.
Laboratory ESTE-L8: 24 laboratory places, 2 students per place maximum (recommended one student per computer).
Attendance not compulsory, but controlled (with student list).
The practices to be realized are published in the webpage of the course, some of them with partial solutions to be completed.
The continuous attendance with positive results to the laboratory (minimum 75% of classes, 9 weeks) will give a 30% of the total grade of the course (it gives up to 3 points out of 10), according to the “continuous evaluation system” of this course.
The computers work with Linux operating system, a free public version.

7. EXAMINATIONS
There will be two calls, an ordinary one in May and an extraordinary one in June.
In the ordinary call of May the students must follow the “continuous evaluation” system composed by partial examinations, except those who officialy renounce to it at the beginning of the semester, presenting a Renounce Form sent to the Director of the Polytechnic School, and who will be evaluated trough a unique final examination.
Books, notes and mobile phones are not allowed in the examinations. A sheet with the prototypes of the needed C functions will be provided.
All the exams are composed by one part of test exercises (5 points) and one part of C programmes development (5 points).

8. EXAMINATIONS PARTIAL EXAMINATIONS:
There will be 2 partial exams of 1 hour duration.
Partial exam 1: Date of exam: 27 March 2017.
- Groups 1A, 1B, 1C: Time 19:00, rooms OA2,OA3,OA4,OA1.
- Groups 1D, 1E, 1F, 1G: Time 20:10, rooms EA2,EA3,EA4,EA7.
Partial exam 2: Same day and hour than the final examination in May.

9. EXAMINATIONS FINAL EXAM IN MAY:
Only for students who renounced to the Continuous Evaluation System.
Date of the exam: 15/May/2017, hour 11:30.
Duration 2 hours, rooms EA5,EA6,EA7,EA8.
EXTRAORDINARY CALL IN JUNE:
For those who did not pass the course in the ordinary call, there will be a final extraordinary examination in June with the same characteristics of the one in May.
Date of the exam: 5/July/2017, hour ???
Duration 2 hours, rooms ???.

10. EVALUATION CRITERIA CONTINUOUS EVALUATION MODE:
Each one of the two partial exams represents the 35% from the total grade of the course, an average mark will be obtained from the 2 exams out of 7 total points. There is no minimum mark needed for any of the exams, in order to obtain the average.
The attendance with useful activity to a minimum of 75% of the laboratory classes (minimum 9 classes) represents the remaining 30% (up to 3 points).
Each student in the laboratory will be evaluated by the teacher a minimum of 3 times during the semester, in weeks chosen ramdomly by the teacher, marked from 0 to 3 points depending on the ability and knowledge shown by the student. The final mark of the laboratory at the end of the course will be obtained as average between all evaluated sessions for each student.

11. EVALUATION CRITERIA CONTINUOUS EVALUATION MODE:
Any student not attending the first partial exam will receive a mark “0” in that exam, in order to obtain a possible average grade with the second exam.
Any student not attending the second partial, having or not attended the first one, will receive a final grade of “Not Presented” in the official call of May, so this call will not be consumed.

12. EVALUATION CRITERIA FINAL EXAMINATION MODE (MAY and JUNE):
The final exam in May will apply only to students who renounced the Continuous Evaluation System and will count the 100% of the course grade (10 points). The possible attendance to the laboratory will not give any extra points.
In the extraordinary call of June, the student who did not pass the ordinary call will realize a final exam that will count the 100% of the course grade, with the same characteristics of the final exam in May.

13. RECOMMENDED BIBLIOGRAPHY
“Curso de Programación con C/C++”. Editor RA-MA.
Author: Fco. Javier Ceballos.
OTHER POSSIBLE BOOKS:
“Estructuras de datos con C y C++”. Editor Prentice-Hall.
Author: Langsam, Augenstein y Tenenbaum
“El lenguaje de Programación C”. Editor Prentice-Hall.
Author: Brian W. Kernighan y Dennis M. Ritchie
“Cómo programar en C/C++”. Editor Prentice-Hall.
Author: H.M. Deitel y P.J. Deitel

14. TIME PLANNING OF THE COURSE
WEEK 1.1. REVIEW OF POINTERS
WEEK 1.2. REVIEW OF POINTERS (II)
WEEK 2.1. REVIEW OF POINTERS (III)
WEEK 2.2. POINTERS AND FUNCTIONS
WEEK 3. POINTERS AND FUNCTIONS (II)
WEEK 4. PASSING STRUCTURES TO FUNCTIONS
WEEK 5. POINTERS TO FUNCTIONS, ARGUMENTS ON THE COMMAND LINE
WEEK 6. RECURSIVITY
WEEK 7. BASIC USE OF FILES
WEEK 8. READING AND WRITING DATA IN FILES
WEEK 9. READING AND WRITING REGISTERS
WEEK 10. ACCESS TYPES IN FILES
WEEK 11. DYNAMIC STRUCTURES
WEEK 12. DYNAMIC STRUCTURES (II)
WEEK 13. BINARY TREES
WEEK 14. ALGORITHMS FOR DATA CLASIFICATION

15. NECESSARY PREVIOUS KNOWLEDGE OF C
Phases in the development of a program. Basic data types. Derivative types. Data type synonymous (typedef). Literals. Identifiers. Key words.
Variables. Symbolic constants. Numerical expressions. Operators. Priority and order in operators evaluation. Conversion of types.
Structure of a program. Inclusión (#include) and substitution (#define) directives. Declarations and definitions. Simple and composed sentences.
Functions: declaration, definition and call of a function. Arguments by value and by reference. Scope of variables. Classes of storage.
Numerical data and character strings. Output with format (printf). Input with format (scanf). Input and output of characters (getchar, putchar). End-of-line and end-of-file characters.
Control sentences: sequential (if, switch) and repetitive (while, for).
Arrays. Numerical one-dimension arrays. Character strings. Functions for character strings. Multi-dimensional arrays.
Arrays of character strings. Copy of arrays. Structures (struct). Arrays of structures. Unions (union). Fields of bits.