Educational guide
IDENTIFYING DATA 2024_25
Subject MATEMÁTICA FINITA I Code 00717002
Study programme
0717 - GRADO INGENIERÍA DATOS INTELIGENCIA ARTIFICIAL
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
mmlopc@unileon.es
Lecturers
LÓPEZ CABECEIRA , MARÍA MONTSERRAT
SÁEZ SCHWEDT , ANDRÉS
Web http://
General description
Tribunales de Revisión
Tribunal titular
Cargo Departamento Profesor
Presidente MATEMATICAS HERMIDA ALONSO , JOSÉ ÁNGEL
Secretario SUAREZ CORONA , ADRIANA
Vocal MATEMATICAS VEGA CASIELLES , SUSANA
Tribunal suplente
Cargo Departamento Profesor
Presidente MATEMATICAS SUSPERREGUI LESACA , JULIAN JOSE
Secretario MATEMATICAS CASTRO GARCIA , NOEMI DE
Vocal MATEMATICAS RODRIGUEZ SANCHEZ , CRISTINA

Competencias
Code  
A18974
B5800
B5806
B5807
B5808
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

Learning aims
Competences
A18974
 B5806
B5807
B5808
 C4
A18974
 B5800
B5806
 C1
A18974
 B5800
B5806
 C1
A18974
 B5800

Contents
Topic Sub-topic
Part I. Logic Logic and deductive reasoning. Proof techniques.
Part II. Sets Set theory. Correspondences, maps and relations.
Part III. Induction and recursion Induction and recursion. Proofs by induction. Recurrence relations.
Part IV. Modular arithmetic Modular arithmetic. Modular inverses. Modular exponentiation. Congruence equations.
Part V. Decidability and completeness Introduction to formal languages and proofs. Decidability and completeness.

Planning
Methodologies  ::  Tests
  Class hours Hours outside the classroom Total hours
Personal tuition 0.5 1 1.5
 
Problem solving, classroom exercises 30 40.5 70.5
 
Lecture 24 30 54
 
Mixed tests 6 18 24
 
(*)The information in the planning table is for guidance only and does not take into account the heterogeneity of the students.

Methodologies
Methodologies   ::  
  Description
Personal tuition Solving doubts prior to the exams. Individual or small group attention during office hours. Classical expository lectures.
Problem solving, classroom exercises Solving problems and exercises in the classroom
Lecture Classical expository lectures.

Personalized attention
 
Personal tuition
Description
Solving doubts prior to the exams. Individual or small group attention during office hours.
Classical expository lectures.

Assessment
  Description Qualification
Mixed tests Two individual tests, written and of practical nature, each worth 45% of the total grade. To be evaluated: correct writing, obtained results, and rigurous justification of all the steps in the solutions. There is no final exam. Tests may be re-evaluated in the second call. 90%
Others Works, assignments and online questionnaries will be evaluated. These activities 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., Discrete Mathematics, 2nd Ed, Oxford University Press, 2002,
Anderson, I, Introducción a la combinatoria, Vicens Vives, 1993,
Julián Iranzo, P., Lógica simbólica para Informáticos, Ra-Ma, 2004,
Abellanas, M., Lodares, D., , Matemática discreta, Ra-ma, 1990,
Biggs, N.L., Matemática discreta, Vicens Vives, 1994,
García Merayo, F., Matemática discreta, Thomson-Paraninfo, 2005,
García, C., López, J.M., Puigjaner, D., Matemática discreta : [problemas y ejercicios resueltos], Pearson Educación, 2002,
Grassmann, W,K., Tremblay, J.P., Matemática Discreta y Lógica, Prentice-Hall, 1996,
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