(*)
No previous knowledge is required
The course aims to introduce students to the basic language of mathematics, logic, and proofs. It also covers the characteristics of different numerical sets, as well as an introduction to topology.
- 1. Elementary logic and mathematical reasoning
- 2. Proof techniques
- 3. Set theory and applications
- 4. Natural, real, and complex numbers
- 5. Introduction to topology
The methodology to be followed consists of:
MD1- Theoretical classes
MD2- Problem-solving and exercise sessions
MD3- Project-based learning
MD4- Laboratory sessions
and will be developed through the following learning activities:
AF1- Concept presentation sessions
AF2- Sessions and resolution of exercises, problems, and cases
AF3- Practical work / project
AF4- Independent study activities
AF5- Assessment activities
The course will be assessed according to the following criteria:
SE1: Exams
SE2: Learning monitoring activities
SE3: Projects and practical work
SE4: Participation
The following will be assessed:
- Conceptual understanding of mathematical foundations
- Rigor and coherence in reasoning
- Clarity and structure in the presentation of results
- The ability to model simple practical cases
- Cormen, Thomas H.; Leiserson Charles E.; Rivest Ronald L; Stein Clifford. Introduction to Algorithms, The MIT Press, 2009.
- Kernighan, Brian W.; Ritchie, Dennis M. El lenguaje de programación C, Prentice-Hall Hispanoamericana, 1991.
- García-Bermejo, J.R. Programación Estructurada en C, Pearson/Prentice-Hall, 2008.
- Hanly, Jerry R.; Koffman, Elliot B.; Problem Solving and Program Design in C, Pearson Education, 2013.
- Joyanes, L. Fundamentos de la programación. Algoritmos y Estructura de Datos, McGraw-Hill, 2008.
- Kruse, Robert Leroy; Tondon, Clovis L.; Leung, Bruce P. Data structures and program design in C, Prentice-Hall, 1997.
- Weiss, Mark Allen. Estructuras de datos y algoritmos, Addison-Wesley Iberoamericana, 1995.