COURSE “PROGRAMMING”

GRADUATE IN ENGINEERING OF TELECOMMUNICATION TECHNOLOGIESGRADUATE IN ENGINEERING OF TELECOMMUNICATION SYSTEMSGRADUATE IN ENGINEERING OF COMMUNICATION ELECTRONICS

GRADUATE IN TELEMATICS ENGINEERING

Year 1, Semester 2

Departament of AutomaticsSuperior Polytechnic School

University of Alcalá

Web page: https://portal.uah.es/portal/page/portal/epd2_asignaturas/asig350009

TEACHERS

ANTONIO GUERRERO BAQUERO (group 1B – 1D – 1E – 1F)Room: E337 Email: antonio.guerrero@uah.es

JAVIER IBAÑEZ DE OPACUA MOLINA (groups 1A – 1ºC – 1G)Room: E334 Email: javier.ibanez@uah.es

MAIN RESPONSIBLE FOR THE COURSE:ANTONIO GUERRERO BAQUERO

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

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 25-January to 5-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.

LABORATORY CLASES

2 hours per week, 12 weeks. Classes start on Monday 8-February, two weeks after the start of theory classes.

Laboratory ESTE-L8: 20 laboratory places, 2 students per place.

Attendance not compulsory, but controlled (with student list).

The practices to realize 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.

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).

EXAMINATIONS

PARTIAL EXAMINATIONS:

There will be 2 partial exams of 1 hour duration.

Partial exam 1: Date of exam ????.

- Groups 1A, 1B, 1C: Time ????, rooms ????.

- Groups 1D, 1E, 1F, 1G: Time ????, rooms ????.

Partial exam 2: Same day and hour than the final examination in May.

EXAMINATIONS

FINAL EXAM IN MAY:

Date of the exam: 16/May/2016, hour ????.

Duration 2 hours, rooms ????.

EXTRAORDINARY CALL IN JUNE:

For those who did not pass the course in the ordinary call, the will be a final extraordinary examination in June with the same characteristics of the one in May.

Date of the exam: 22/June/2016, hour ????

Duration 2 hours, rooms ????.

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 laboratory session will be marked from 0 to 3 points by the teacher for each student, depending on the final results and the time needed to reach them. The absence to one session will mark 0 points. The final mark of the laboratory at the end of the course will be obtained as average between all attended and not attended sessions.

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.

EVALUATION CRITERIA

FINAL EXAMINATION MODE (MAY and JUNE):

The final exam in May 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.

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

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. PASSING STRUCTURES TO FUNCTIONS• WEEK 4. , POINTERS TO FUNCTIONS, ARGUMENTS ON THE

COMMAND LINE• WEEK 5. RECURSIVITY• WEEK 6. BASIC USE OF FILES• WEEK 7. READING AND WRITING DATA IN FILES• WEEK 8. READING AND WRITING REGISTERS• WEEK 9. ACCESS TYPES IN FILES• WEEK 10. PRACTICAL APPLICATION OF FILES• WEEK 11. DYNAMIC STRUCTURES• WEEK 12. DYNAMIC STRUCTURES (II)• WEEK 13. BINARY TREES• WEEK 14. ALGORITHMS FOR DATA CLASIFICATION