Checking date: 28/06/2021


Course: 2021/2022

Discrete Mathematics
(15971)
Study: Dual Bachelor in Computer Science and Engineering, and Business Administration (233)


Coordinating teacher: MOMPÓ PAVESI, EMANUEL GASTON

Department assigned to the subject: Department of Mathematics

Type: Basic Core
ECTS Credits: 6.0 ECTS

Course:
Semester:

Branch of knowledge: Engineering and Architecture



Requirements (Subjects that are assumed to be known)
Calculus (First year / First semester) Linear Algebra (First year / First semester)
Objectives
Areas of learning: R1. Knowledge and comprehension: Students have basic knowledge and comprehension on the scientific and technological grounds of Informatics Engineering, as well as specific knowledge on Computer Science, Computational Engineering, and Information Systems. R4. Research and innovation: Students are able to use proper methods in research and attain innovative results in the context of Informatics Engineering. R5. Applications in engineering: Students are able to use their knowledge and comprehension for problem solving, research leading, and devices or process design in the context of Informatics Engineering, in good agreement with cost, quality, security, efficiency, ecological respect, and ethical criteria. These skills include the knowledge, use and limitations of informatics systems, process engineering, computer architecture, computational models, teams, practical work, technical bibliography and information sources. Basic and general competences: CGB1 ¿ Students are able to solve the mathematical problems relevant in engineering, as well as being able to apply their knowledge on: Linear Algebra; Differential and Integral Equations; Numerical Methods; Numerical Algorithmics; Statistics and Optimization. CGB3 ¿ Students are able to understand and master the basic concepts on Discrete Mathematics, Logic, Algorithmics, and Computational Complexity, as well as their use in engineering problems. CGO12 ¿ Students are knowledgeable in and are able to use basic tools from Economy, Human Resources Management, Project Management, as well as legislation, regulation, and standardization in the context of IT projects, in good agreement with the acquired knowledge. CB1 ¿ Students have demonstrated knowledge and understanding in study areas that belong to secondary-level education, and, although supported on advanced text books, also in areas that are in the forefront of the field of study.
Skills and learning outcomes
Description of contents: programme
1. Basic set theory. 2. Basic and advanced combinatorics. 3. Graph theory. 4. Algorithms in graph theory. 5. Equivalence relations and application in modulcar arithmetic. 6. Order relations and mathematical induction. 7. Lattices and Boolean algebras.
Learning activities and methodology
* THEORETICAL-PRACTICAL CLASSES: 2 ECTS. Concepts and knowledge to be acquired are presented in these sessions. Students are provided with lecture notes and can find basic reference bibliography to facilitate class understanding and posterior personal work. Exercises are solved by students for self-assessment and achievement of necessary skill. During the practical sessions, students are presented with exercises that are discussed and solved. * INDIVIDUAL AND GROUP WORK: 2.5 ECTS. Students' personal work. * CONTINUOUS ASSESSMENTS. 1 ECTS. Knowledge, skills and abilities, gradually acquired, are globally assessed. They serve as self-assessment of progress to adapt learning strategies if necessary. * TUTORING SESSIONS. Sessions to clarify theoretical or practical issues encountered by students on an individual or in-group basis. * FINAL EXAM: 0.5 ECTS. Knowledge, skills and abilities acquired over the course of the academic semester are globally assessed.
Assessment System
  • % end-of-term-examination 60
  • % of continuous assessment (assigments, laboratory, practicals...) 40
Calendar of Continuous assessment
Basic Bibliography
  • F. García Merayo. Matemática Discreta. Paraninfo. 2015
  • J. Matousek and J. Nesetril. Invitation to Discrete Mathematics. Oxford. 2004
  • K.H. Rosen. Discrete Mathematics and Its Applications. McGraw-Hill. 7th edition, 2012
Additional Bibliography
  • N.L. Biggs. Discrete Mathematics. Oxford University Press. 2002
  • R.P. Grimaldi. Discrete and Combinatorial Mathematics: An Applied Introduction. Addison Wesley. 2003

The course syllabus may change due academic events or other reasons.