Titular Professors
Not required
1. Knowledge of computers and their programming.
2. Software implementation.
1 - Introduction
2 - Basic Algorithms
3 - Procedures and Functions
4 - Structured Data Types
5 - Introduction to Pointers
The subject of Programming Fundamentals promotes active learning in which students are constantly engaged in their own learning process, developing practical tasks from day one using their laptops as essential tools. Classes combine theoretical presentations of new concepts with daily programming sessions, allowing students to apply and consolidate their acquired knowledge. Throughout the course, students reinforce their learning through continuous assessment activities and labs that integrate and review the material covered in class.
Continuous assessment: Moderately significant assessment based on regularly conducted laboratory sessions that allow students to put previously acquired knowledge into practice and maintain up-to-date learning throughout the course.
Practical exercises: Highly significant assessment that ensures students apply their acquired knowledge in the form of a project.
Final exams: Highly significant assessment that ensures students comprehensively integrate and apply the knowledge developed during the semester.
The final grade for the course is composed of two equally weighted components: knowledge and practical skills. The knowledge grade will be determined by the higher of the two scores obtained: the final exam or the combined score of the exam and the results of the continuous assessment.
- Manelli, Luciano. Introducing Algorithms in C: A Step-by-Step Guide to Algorithms in C. Apress, 2020.
- Hanly, Jerry R.; Koffman, Elliot B.; Problem Solving and Program Design in C, Pearson Education, 2013.
- Cormen, Thomas H.; Leiserson Charles E.; Rivest Ronald L; Stein Clifford. Introduction to Algorithms, The MIT Press, 2009.
- Joyanes, L. Fundamentos de la programación. Algoritmos y Estructura de Datos, McGraw-Hill, 2008.
See electronic folder of the subject.