Code |
11547
|
Year |
1
|
Semester |
S2
|
ECTS Credits |
6
|
Workload |
TP(60H)
|
Scientific area |
Mathematics
|
Entry requirements |
This curricular unit don´t have entry requirements. Mathematical maturity at the level of Calculus I is recommended, but not mandatory.
|
Mode of delivery |
Face-to-face.
|
Work placements |
Non applicable.
|
Learning outcomes |
This Curricular Unit aims to give an introduction to several themes of Discrete Mathematics: set theory, relations, equivalence relations, functions, order relations, Boole algebras, mathematical induction, counting principles and graph theory. In the end of this Curricular Unit the student should be able to: -discern the different types of proofs -compute small theoretical proofs within the scope of the subjects covered in the discipline -compute the partition induced by an equivalence relation and vice versa -compute the transitive closure of a relation -represent graphically order relations -compute proofs using mathematical induction -resolve counting problems -manipulate binomial coefficients -compute an Euler circuit using the Fleury algorithm -compute a minimal generator tree using Kruskal's algorithm
|
Syllabus |
1- Set theory. 2- Relations, equivalence relations, functions, order relations, Boole algebras. 3- Mathematical induction. 4- Counting principles. 5- Graph theory.
|
Main Bibliography |
- Discrete Mathematics and Its Applications 7th edition. Rosen, Kenneth. - Apontamentos de Matemática Discreta. Cruz, Henrique & Rosa, Silvério. - Notes on Combinatorics. Cameroon, Peter. - Ten Chapters of the Algebraical Art. Cameron, Peter.
|
Language |
Portuguese. Tutorial support is available in English.
|