Fundamentos Matemáticos para Computación (FMC)

Code ISIS 1107

Credits 3 Semester 2
Area Curso fundamental en Ingeniería de Sistemas y Computación
Pre-requisites ISIS 1204 O ISIS 1207

General objective and focal point

Mathematical Foundations for Computing is a course that aims to give students the fundamentals to
argument formally, with the aim of applying this skill to problems in his profession. The student should
understand discrete structures, and be able use these structures to model and construct
mathematical/logic arguments. Additionally, the student should learn how discrete mathematics can be
applied to computing.

Course Schedule

Date
Topic References
Week

8-08 [1] Chap. 1.1 Ej 1, 3, 12, 15,

Propositional Logic 16, 34, 35

11-08 [1] Chap. 1.2 Ej 2, 7, 11, 17,

1
Applications of propositional Logic 18

14-08 [1] Chap. 1.3 Ej 1, 7, 27, 29,

Propositional Equivalences
30, 35, 39, 65
2 18-08 [1] Chap. 1.4 Ej 10, 11, 19,
Predicates and Quantifiers 25, 33, 63 – 1.5 Ej 3, 13, 15,
26
22-08 [1] Chap. 1.6 Ej 1, 3, 5, 9, 23,
Rules of Inference 29
3
25-08 [1] Chap. 1.7 Ej 1, 9, 17, 29,
Introduction to proofs
35
28-08
Proofs Methods and Strategy [1] Chap. 1.8 Ej 1, 21, 36, 37
4 1-09
Sets [1] Chap. 2.1 Ej 1, 7, 9, 34, 35

4-09 [1] Chap. 2.2 Ej 3, 17, 19, 21,

5 Set Operations
35

1
 Date
Topic References
Week

8-09 Review
11-09 Review
6
15-09 Exam 1
18-09 [1] Chap. 4.1 Ej 5, 7, 13, 17,
Divisibility and modular arithmetic
27, 37
7
22-09
Primes and Greatest Common Divisors [1] Chap. 4.3 Ej 3, 21, 33, 39

25-09 Solving Congruences [1] Chap. 4.4 Ej 1, 21, 27, 33

8
29-09 Cryptography (RSA – Afin) [1] Chap. 4.6 Ej 1, 25, 27

Break
9-10 Sequences and summations (definitions)/ Math- [1] Chap. 2.4 Ej 1, 11, 29 -
9 ematical Induction Chap 5.1 Ej 3, 4, 9, 11
13-10 Strong Induction [1] Chap 5.2 Ej 1, 7, 29
17-10 Recursive Definitions and Structural Induction [1] Chap 5.3 Ej 1, 3, 5
10
20-10 Recursive Definitions and Structural Induction [1] Chap 5.3
23-10 Review
11 27-10
Exam 2

30-10 Correction of algorithms [1] Chap. 5.5 Ej 2, 4, 6

12 3-11
Correction of algorithms [1] Chap. 5.5

7-11 Relations and their properties [1] Chap. 9.1 Ej 1, 3, 32

13
10-11 Equivalence relations [1] Chap. 9.5 Ej 1,15, 16
14-11 [1] Chap 6.1 Ej 10, 23, 68
The Basics of Counting
[1] Chap 6.2 Ej 4, 17, 20
14
17-11 Permutations and Combinations [1] Chap 6.3 Ej 5, 22, 33, 36
20-11 Permutations and Combinations [1] Chap 6.3
15 24-11
Review

27-11
Review
16
1-12 Exam 3

2
TEXTBOOK(S) AND REQUIRED TOOLS OR RESOURCES

[1] Discrete Mathematics and its applications, K.H. Rosen, McGraw Hill Higher Ed., 8th Edition. 2012

Class policies (see Bloque neon for the full class policies)
• There are 3 exams all of which include all material seen since the beginning of the course. There
is no final exam.
• During the lecture hours, there may also be quizzes which will evaluate the students’
preparedness for the class.

Grading
• Exams 75%
o Exam 1: 25%
o Exam 2: 25%
o Exam 3: 25%
• Lab & Quizzes: 10%
• Homework: 15%
• The final grades for the course vary between 1.50 and 5.00, in intervals of 0.5. The distribution of the note
will be determined taking into account the performance of the entire course. Students will be ordered
and grouped according to the final grade and all students in the same group will be assigned the same
grade. There may be empty groups.
• Notes less than 3.0 will not be approached upwards. To pass the course you must have a grade higher
than 3.0.