Code: | M2007 | Acronym: | M2007 | Level: | 200 |
Keywords | |
---|---|
Classification | Keyword |
OFICIAL | Mathematics |
Active? | Yes |
Responsible unit: | Department of Mathematics |
Course/CS Responsible: | Bachelor in Mathematics |
Acronym | No. of Students | Study Plan | Curricular Years | Credits UCN | Credits ECTS | Contact hours | Total Time |
---|---|---|---|---|---|---|---|
L:B | 0 | Official Study Plan | 3 | - | 6 | 56 | 162 |
L:CC | 2 | Plano de estudos a partir de 2014 | 2 | - | 6 | 56 | 162 |
3 | |||||||
L:F | 0 | Official Study Plan | 2 | - | 6 | 56 | 162 |
3 | |||||||
L:G | 2 | study plan from 2017/18 | 2 | - | 6 | 56 | 162 |
3 | |||||||
L:M | 50 | Official Study Plan | 2 | - | 6 | 56 | 162 |
L:Q | 0 | study plan from 2016/17 | 3 | - | 6 | 56 | 162 |
The student should know and be able to apply the concepts and basic results covered in the course. It is intended that this unit contribute to the development of skills in the fields of discrete mathematics and algorithms.
It is intended that by the end of this course the student can:
• Complete and give structure to some previously acquired basic knowledge;
• Solve problems through structured elementary methods;
• Understand and apply basic and universal concepts, that are basic for several tools of various sciences, in a context close to the applications;
• Use (and create, whenever possible) algorithmic solutions to various problems.
1. Revision of some basic principles of combinatorics: counting, listing, ordering, sets and multisets, counting functions of certain types (one-to-one, onto, increasing, decreasing), partitions, etc.; the combinatorics of permutations.
2. Decision trees and recursion: basic definitions, order, rank, depth-first and breadth first; recursive algorithms, sorting, Gray codes; recurrence relations, characteristic equation, Fibonacci and Catalan sequences, derrangements.
3. Introduction to graph theory: definitions and examples, isomorphism, random graphs; digraphs and flows; Euler circuits and hamiltonian cycles; trees, Prim and Kruskal algorithms, depth-first and breadth first.
4. Introduction to the analysis of algorithms. [Time permitting.]
Lectures and classes: The contents of the syllabus are presented in the lectures, where examples are given to illustrate the concepts. There are also practical lessons, where exercises and related problems are solved. All resources are available for students at the unit’s web page.
designation | Weight (%) |
---|---|
Exame | 100,00 |
Total: | 100,00 |