Educational guide
IDENTIFYING DATA 2023_24
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
Otros
Prerequisites
Department MATEMATICAS
Coordinador
CARRIEGOS VIEIRA , MIGUEL
E-mail mcarv@unileon.es
hdiem@unileon.es
Lecturers
CARRIEGOS VIEIRA , MIGUEL
DÍEZ MACHÍO , HÉCTOR
Web http://
General description
Tribunales de Revisión
Tribunal titular
Cargo Departamento Profesor
Presidente MATEMATICAS GRANJA BARON , ANGEL
Secretario MATEMATICAS LOPEZ CABECEIRA , MONTSERRAT
Vocal MATEMATICAS PISABARRO MANTECA , MARIA JESUS
Tribunal suplente
Cargo Departamento Profesor
Presidente MATEMATICAS TROBAJO DE LAS MATAS , MARIA TERESA
Secretario MATEMATICAS MAZCUñAN NAVARRO , EVA MARIA
Vocal QUIROS CARRETERO , ALICIA

Competencias
Code  
A18117
B5618
B5619
B5623
B5624
B5625
C1 CMECES1 That students have demonstrated possession and understanding of knowledge in an area of study that is based on general secondary education, and is usually found at a level that, although supported by advanced textbooks, also includes some aspects that involve knowledge from the cutting edge of their field of study
C4 CMECES4 That students can transmit information, ideas, problems and solutions to both a specialised and non-specialised audience
C5 CMECES5 That students have developed those learning skills necessary to undertake further studies with a high degree of autonomy

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 30 30 60
 
Problem solving, classroom exercises 25 25 50
 
Seminars 5 10 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
Seminars

Personalized attention
 
Lecture
Problem solving, classroom exercises
Description

Assessment
  Description Qualification
Seminars 5%
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 45% of the total grade, and may be re-evaluated in the second call. 90%
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. 10%
 
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 (10%) 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%.


Sources of information
Access to Recommended Bibliography in the Catalog ULE

Basic Biggs, N.L., Matemática discreta, Vicens Vives, 1994
W.K. Grassmann, J.P. Tremblay, Matemática discreta y Lógica. Una perspectiva desde la Ciencia de la Computación, Prentice Hall, 1997
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
Y. Nievergelt, Foundations of Logic and Mathematics. Applications to Computer Science and Cryptography, Birkhäuser, 2002
P.R. Halmos, Naive set theory, Springer, 1974
P.T. Johnstone, Notes on logic and set theory, Cambridge, 1996
Cameron, P.J., Sets, logic and categories, Springer, 1999
D.E. Knuth, The Art of Computer Programming. Volume 1. Fundamental Algorithms, Addison-Wesley, 1997
D.E. Knuth, The Art of Computer Programming. Volume 2. Seminumerical Algorithms, Addison-Wesley, 1998
D.E. Knuth, The Art of Computer Programming. Volume 3. Sorting and Searching, Addison-Wesley, 1998
D.E. Knuth, The Art of Computer Programming. Volume 4A. Combinatorial Algorithms, Addison-Wesley, 2011


Recommendations