Educational guide
IDENTIFYING DATA 2020_21
Subject DISCRETE MATHEMATICS Code 00709002
Study programme
0709 - GRADO EN INGENIERÍA INFORMÁTICA
Descriptors Credit. Type Year Period
6 Basic Training First First
Language
Castellano
Prerequisites
Department MATEMATICAS
Coordinador
SÁEZ SCHWEDT , ANDRÉS
E-mail asaes@unileon.es
darim@unileon.es
Lecturers
ARIAS MOSQUERA , DANIEL
SÁEZ SCHWEDT , ANDRÉS
Web http://
General description
Tribunales de Revisión
Tribunal titular
Cargo Departamento Profesor
Presidente MATEMATICAS CARRIEGOS VIEIRA , MIGUEL
Secretario MATEMATICAS TROBAJO DE LAS MATAS , MARIA TERESA
Vocal MATEMATICAS GARCIA FERNANDEZ , ROSA MARTA
Tribunal suplente
Cargo Departamento Profesor
Presidente MATEMATICAS GOMEZ PEREZ , JAVIER
Secretario MATEMATICAS MAZCUñAN NAVARRO , EVA MARIA
Vocal MATEMATICAS RODRIGUEZ SANCHEZ , CRISTINA

Competencias
Code  
A18117
B5618
B5619
B5623
B5624
B5625
C1
C4
C5

Learning aims
Competences
1. The students understand the main concepts of discrete mathematics and logics, and they apply them in solving mathematical problems appearing in engineerings. A18117
B5618
C1
2. Students show skills and abilities in analysis, synthesis, critical reasoning and decision making. B5623
B5624
3. Students apply the studied concepts in the elaboration of correct argumentations and reasonings. They are able to face up with situations where they need new mathematical knowledge and techniques. They have developed their autonomous learning skills. B5619
C5
4. Students are able to communicate mathematical ideas and information in oral and written form. B5619
B5625
C4

Contents
Topic Sub-topic
I: LOGIC AND SETS. 1. INTRODUCTION TO FORMAL LOGIC.
Fundamentals of Logic. Proof techniques

2. SETS.
Intuitive set theory. Correspondences and functions. Relations.
II: COMBINATORICS AND ALGEBRAIC STRUCTURES 1. COUNTING TECHNIQUES.
Combinatorics and recurrence relations.

2. ALGEBRAIC STRUCTURES.
Boolean Algebra and other algebraic structures: groups, semigroups, rings and fields.

Planning
Methodologies  ::  Tests
  Class hours Hours outside the classroom Total hours
Lecture 25 25 50
 
Problem solving, classroom exercises 30 30 60
 
Assignments 15 0 15
 
Mixed tests 5 20 25
 
(*)The information in the planning table is for guidance only and does not take into account the heterogeneity of the students.

Methodologies
Methodologies   ::  
  Description
Lecture
Problem solving, classroom exercises
Assignments

Personalized attention
 
Description

Assessment
  Description Qualification
Mixed tests Two written exams, where problems are proposed to be solved by applying the theoretical contents studied in the classroom. Aspects to be evaluated, among others: the correct use of the mathematical and logical language, the rigorous explanation of all steps of the solutions, as well as the numerical results obtained. Each exam is worth 40% of the total grade, and may be re-evaluated in the second call. 80%
Others A continuous evaluation of the work carried out by the student will be carried out through the evaluation of the following activities: a series of guided activities, tests and exercises, to be performed and delivered during class time, or through the moodle platform of the subject, in the periods indicated. In the case of non-contact activities, the in-person explanation of the submitted works may be required, as well as proposing to make some modification. Works and assignments are not re-evaluated in the second call. 20%
 
Other comments and second call

In all tests: the use of mobile phones and other electronic devices is strictly forbidden, and will result in grade zero. Only the material specifically allowed by the instructors may be used.


Second call. Students may choose between these two options:

 - maintain/preserve the grades obtained in all works and assignments (20%) and repeat one or both written tests. If either of the parts is not repeated in the second call, the grade corresponding to that part obtained in the first call will be maintained in the second call.

 - remove/withdraw all works and assigments from the calculation of the final grade, in this case each of the written tests will be worth 50%.


ADDENDUM
Contingency plan due to COVID-19 emergency conditions that prevents from presence based teaching
COVID-19 Teaching Guide Addendum Access Link


Sources of information
Access to Recommended Bibliography in the Catalog ULE

Basic García, C., López, J.M., Puigjaner, D., Matemática discreta : [problemas y ejercicios resueltos], Pearson Educación, 2002
Anderson, I., Introducción a la combinatoria, Vicens Vives, 1993
Lipschutz, S., Lipson, M., 2000 problemas resueltos de matemática discreta, McGraw-Hill, Interamericana de España, 2004
Anderson, I., A first course in Combinatorial Mathematics, 2nd Ed., Clarendon Press, Oxford, 1988
Koh Khee Meng, Tay Eng Guan, Counting, World Scientific, 2002
Biggs, N.L., Discrete Mathematics, 2nd Ed, Oxford University Press, 2002
Biggs, N.L., Matemática discreta, Vicens Vives, 1994
Abellanas, M., Lodares, D., Matemática discreta, Ra-ma, 1990
García Merayo, F., Matemática discreta, Thomson-Paraninfo, 2005
Caballero, R., Hortalá, M.T., Martí, N., Matemática Discreta para Informáticos. Ejercicios resueltos, Pearson Prentice Hall, 2007
Hortalá, M.T., Matemática discreta y lógica matemática , Editorial complutense, 1998
Rosen, K.H., Matemática discreta y sus aplicaciones, McGraw-Hill, Interamericana de España, 2004
Grimaldi, R.P., Matemáticas discreta y combinatoria : una introducción con aplicaciones, Addison Wesley, 1998
Lipschutz, S., Lipson, M., Matemáticas discretas, McGraw-Hill, Interamericana de España, 2009

Complementary Schumacher, C., Chapter zero : fundamental notions of abstract mathematics, Addison-Wesley Pub. Co., 1997
Cameron, P.J., Sets, logic and categories, Springer, 1999


Recommendations