DISCRETE MATHEMATICS SYLLABUS

1. GENERAL DATA

Faculty: Engineering
Career: All engineering
Coordinator:
Requirement
s:
Number of credits: 5
Number of hours: Theoretical- Hours of
Assessment
practical reflective Total
hours
hours independent
nAGg vop 89100

56 2 work
8 66

RATIONALE

The discrete mathematics course provides students with the criteria and methods to
model, analyze, and develop a knowledge base of mathematical structures that will allow
them to improve and face continuous changes in computing.

SUMMA
RY
The course content comprises six units: Sets. Fundamental principles of counting.
Relationships and Functions. Algorithms. Recurrence Relations. Graph Theory. Trees and
searching. Automata, grammars and languages. Boolean algebra.

4. GENERAL LEARNING ACHIEVEMENT

At the end of the course, the student identifies and uses tools from discrete mathematics
in the construction of analytical models for solving computational problems with an
algorithmic and creative approach.

5. UNITS AND SPECIFIC LEARNING ACHIEVEMENTS

Week:
Unit 1: Sets. Fundamental principles of counting
1, 2 and 3
Specific learning achievement:
At the end of the unit, the student recognizes and interprets the results of set theory,
analyzes and synthesizes the results of combinatorial analysis for grouped object data and
establishes counting methods.
Syllabus:
1.1 Sets and subsets.

1
 UNIVERSITY
TECHNOLOGIC
AL
FROM PERU

1.2 Relationship of Belonging and Inclusion. Operations with sets

1.3 Fundamentals of Counting: Addition and Multiplication
1.4 Linear and circular permutations
1.5 Permutations with repetitions and combinations
1.6 Pigeon House Principle
1.7 The Towers of Hanoi.

Week:
Unit 2: Relationships and Functions. Recurrence relations.
Tüenohog #2 by

4, 5 and
Specific learning achievement: 6
Peru

At the end of the unit, the student recognizes a relationship with respect to a function and
finds the solutions to a recurrence relationship.

Syllabus:
2.1
Relationships and properties
2.2
Equivalence relation.
2.3
Permutation, inverse and composite functions
2.4
Recurrence relations. Properties
2.5 Application problems with recurrence
2.6 Solution of a homogeneous first-order linear relationship
2.7 Solution of homogeneous second-order linear recurrence relation.
2.8 Non-homogeneous linear recurrence relations

Week:
Unit 3: Graph theory
7, 8 and 9
Specific learning achievement:
At the end of the unit, the student identifies the different real situations that can be modeled in
a simple way through the concept of a graph. And he knows the theory of an Eulerian and
Hamiltonian graph.

Syllabus:
3.1 Concepts of graph theory and applications in real problems.
3.2 Paths and cycles in graphs and multigraphs
3.3 Complete and bipartite graphs
3.4 Trajectory and Euler cycles
3.5 Hamilton's trajectory and cycles
3.6 Weighted Graphs
3.7 Traveling salesman problem.
3.8 Adjacency and incidence matrix
3.9 Matrix applications to path traversals.

Week:
Unit 4: Trees and Search
10 and 11
Specific learning achievement:
At the end of the unit, the student solves exercises and/or computing problems by appropriately
using an algorithm to decide the shortest path between two vertices on a graph.
Syllabus:

2
 UNIVERSITY
TECHNOLOGIC
AL
FROM PERU

4.1 Trees: Terminology and characterization of trees

4.2 Properties of Trees
4.3 Spanning trees and binaries

3
 UNIVERSITY
TECHNOLOGIC
AL
FROM PERU

4.4 Tree search.

4.5 Isomorphism of trees
4.6 Prim and Kruskal trees

Week:
Unit 5: Languages and finite state machines.
12
The
Heraldry Specific learning achievement:
of
Tsok2#e
of Peru
At the end of the unit, the student defines the states that the machine can have in a data
table.

Syllabus:
5.1 Languages
5.2 grammars.
5.3 Representations between languages and grammars
5.4 Finite State Machines
5.5 Deterministic finite automata
5.6 Nondeterministic finite automata.

Week:
Unit 6: Boolean Algebra.
13 and 14

Specific learning achievement:

At the end of the unit, the student solves arithmetic operations in the different numbering
systems and represents the logical circuits using logic gates and logical functions.
Syllabus:
6.1 Number Systems and Conversions
6.2 Boolean Algebra and Properties.
6.3 Logic Gates
6.4 Logic Circuits
6.5 Karnaugh maps

6. METHODOLOGY

The general methodology will be the exposition: The contents are presented by the
teacher. Examples and counterexamples of the methods presented are presented and the
student is motivated to investigate their application in problems related to engineering.

Students are organized into 4 or 5 members to participate in problem solving.

4
 UNIVERSITY
TECHNOLOGIC
AL
FROM PERU

7. EVALUATION SYSTEM

The course will have the following

evaluations:
Guy Description Date Observation Recoverable
PE Entrance test Week 1 Individual practice carried out
during the class session NO
PC1 Graded Practice 1 Week 3 Individual practice carried out
during the class session NO
PC2 Graded Practice 2 Week 6 Group practice (teams of 2
students) carried out during the NO
class session
PC3 Graded Practice 3 Week 9 Group practice (teams of 2
students) carried out during the NO
class session
PC4 Graded Practice 4 Week 13 Individual practice carried out
TemoA
g#2
from
during the class session NO
Peru
EF Final exam Week 15 Individual exam YEAH
ER Examination of Week 16 Individual exam
latecomers NO

The final average will be calculated as follows:

PF = 0.0 PE +0.15PC1 + 0.15PC2 + 0.20PC3 + 0.20PC4
+ 0.3EF Where:
PE = Entrance Test
PC1 = Practice 1
PC2 = Practice 2
PC3 = Practice 3
PC4 = Practice 4
EF = Final Exam
PF = Final Average

Note:

• Only the final exam may be delayed.

• The rescheduled exam includes the contents of the entire course.
• No qualifying practices are eliminated.
• The minimum passing grade is 12 (twelve)
• In the event that a student does not take a graded practical (PC) and therefore obtains NS, this is
replaced with the grade obtained in the final exam. In the event that the student has more than one
graded practice not taken, only the graded practice with the greatest weight is replaced. It is not
necessary for the student to complete any procedure for this replacement to take place.
• The tolerance for entry to perform qualified practices will be up to ten (10) minutes after they have
started. After this period of time, students will not be allowed to enter.

8. SOURCES OF INFORMATION
1. Bernard Kolman – Robert C. Busty – Sharon Ross: Discrete Mathematical Frameworks for
Computation, 3rd edition, 1997.
2. RICHARD JOHNSONBAUGH: Discrete Mathematics. Pearson Education Publishing House, Mexico, 6th
edition, 2005.
3. GRIMALDI, RALPH P. : Discrete mathematics and combinatorics. 3rd edition. Editorial

5
 UNIVERSITY
TECHNOLOGIC
AL
FROM PERU

Addison Wesley, 1998.

4. TREMBLAY – GROSSMAN: Discrete mathematics. 3rd edition. Addison Wesley Publishing, 1998.
5. CL LIU: Elements of Discrete Mathematics. 2nd edition. Mc Graw Hilll Web graphy: Sets:
http://www.x.edu.uy/inet/discretasur.pdf
6. ROSEN, KENETH H.: Discrete mathematics and its applications.. 5th. Edition. Mc Graw Hill. 2004
7. Graphs and Trees: http://es.scribd.com/doc/11494612/18/TEORIA-DE-GRAFOS-Y-SU- APLICACION
8. Applications of graph theory to some strategy games: http://revistasuma.es/IMG/pdf/46/031-
035.pdf
9. SCHEDULE OF ACTIVITIES

Week Session Issue Activities and Assessments

Learning unit
11 Sets and subsets Relation of
1 belonging Solve exercises in class
and
n 1
Teamwork.
Operations with sets. Entrance
2 Job Assignment
Test
Self-employed 01
3
1 Fundamental principles of
O 1 counting: addition and Solve exercises in class
R ity 1: multiplication.
Sets. 2 Permutations linear
Fundamentals of and
2 Exercise solution, Teamwork
counting circulars.
Permutations with repetitions and

The beginning of the pigeon loft Students solve exercises and

1
The towers of Hanoi problems in groups

3 Graded Practice 1:
Unit 01
2 Unit 1 Assessment
Self-employment: 4 points
Classroom evaluation: 16
points
Relations and properties Solution of exercises
1
Equivalence relation Teamwork
Unit 2:
4 Teamwork.
Permutation Functions of permutation,
Relations and 2 Job Assignment
inverse and compound
Functions. Self-employed 02
Recurrence Recurrence relations
relations Properties
5 1 Solve exercises in class
Application problems with
recurrence

6
 UNIVERSITY
TECHNOLOGIC
AL
FROM PERU

Solution of a homogeneous first

2 and second order linear Exercise solution, Teamwork
relationship.
Solution of relationship of
1 non-homogeneous first and Students solve exercises and
second order linear recurrence problems in groups

Graded Practice 2:
6
Unit 02
2 Unit 2 Assessment Self-employment: 4 points
Classroom evaluation: 16
points

Unit 3: Graph theory concepts and

Solution to exercises
Graph theory 1 applications in issues
Teamwork
real.
7
Paths and cycles in graphs and Teamwork.
2 multigraphs Job Assignment
Complete and bipartite graphs Self-employed 03

1 Euler paths and cycles Hamilton Solve exercises in class

paths and cycles Weighted graphs
8
2 Traveling salesman problem. Exercise solution, Teamwork
11
tea
Matrix of adjacency
and Students solve exercises and
1 incidence problems in groups
Applications of the matrix to
5 trajectory paths.
9 Graded Practice 3:
Unit 03
2 Unit 3 Assessment Self-employment: 4 points
Classroom evaluation: 16
points

Trees: Terminology
Solve exercises in class
1 and
tree characterization Tree
10
Teamwork.
Binary and spanning trees Tree
Unit 4: Trees and 2 Job Assignment
search Tree isomorphisms
Search Self-employed 04
1 Primrose Trees Solve exercises in class
11
2 Kruskal trees
Exercise solution, Teamwork
Unit 5: Languages
Languages and Grammars
12 1 Solve exercises in class.
finite state Representations between
machines languages and grammars

7
 Finite State Machines Automata
finite Students solve exercises and
2
deterministic Non-deterministic problems in groups.
finite automata.

Graded Practice 4:
Unit 04
Self-employment: 4 points
1 Unit 4 Assessment Classroom evaluation: 16
points
13

Numbering Systems Conversions,

Unit 6: operations with numbering Solution of exercises
Boolean Algebra 2 systems. Teamwork

Algebra Boolean
1 and Solve exercises in class
Properties.
14
Logic circuits
2 Students solve exercises and
Karnaugh maps
problems in groups.

15 FINAL EXAM

16 EXAMINATION OF LAYOVERS