Code: | M3011 | Acronym: | M3011 | Level: | 300 |
Keywords | |
---|---|
Classification | Keyword |
OFICIAL | Mathematics |
Active? | Yes |
Responsible unit: | Department of Mathematics |
Course/CS Responsible: | Bachelor in Biology |
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 | 0 | Plano de estudos a partir de 2014 | 2 | - | 6 | 56 | 162 |
3 | |||||||
L:F | 2 | Official Study Plan | 2 | - | 6 | 56 | 162 |
3 | |||||||
L:G | 3 | study plan from 2017/18 | 3 | - | 6 | 56 | 162 |
L:M | 36 | Official Study Plan | 2 | - | 6 | 56 | 162 |
3 | |||||||
L:Q | 0 | study plan from 2016/17 | 3 | - | 6 | 56 | 162 |
With this course, it is intended that students will know and understand some of the main results of Discrete Mathematics that, for its present relevance within Mathematics, and by its special applicability, inside and outside Mathematics, should be of general knowledge for mathematicians. In this course the students should also develop their ability to solve combinatorial problems and the ability do solve problemas looking for the more suitable structure.
Upon completing this course, the student should know and be able to apply the concepts and results covered in the course. It is intended that this unit contribute to the furthering of skills in the field of discrete mathematics. In summary, it is intended that upon completion of this class the student can:
-Understand and apply fundamental combinatorial techniques as well as understand when these can or cannot be applied.
-Use appropriate techniques and problem solving skills on new problems.
-Recognize mathematical structures (e.g. algebraic ones) in combinatorial problems, can formulate them and solve them using the corresponding techniques.
-Be mathematically creative and inquisitive, being capable of formulating interesting new questions in combinatorics.
Module AUTOMATA:
WORDS AND LANGUAGES: words, free monoids, languages.
RATIONAL AND RECOGNIZABLE LANGUAGES: rational expressions, finite automata, alternative versions, transition monoid, recognizability by a finite monoid.
CLOSURE OPERATORS: closure properties of recognizable languages, Kleene's Theorem.
DECIDIBILITY: minimal automaton of a rational language, syntactic monoid, decidable properties, pumping lemma.
Sharkovsky's Theorem
Dynamics of the shift mapping
Dynamics of the quadratic family
Sperner's Lemma and Brower's Fixed Point Thorem
Matchings and the personnel assignment problem.
Eulerian graphs and the Chinese postman problem.
Hamiltonian graphs and the travelling salesman problem.
Expositional classes with discussion of examples and resolution of exercises.
designation | Weight (%) |
---|---|
Teste | 100,00 |
Total: | 100,00 |
There will be a test after the classes of each module are completed, worth 6.67 points.
The tests are mandatory to be approved in the first season of exams, since there will be exam only at the second season.
Those which will have a positive grade in a test do not need to do the part of the second season exam corresponding to that module, keeping the test's grade. But this is not possible for those cases where the student has already been approved.
Those which submit for marking the part of the second season exam corresponding to a module, will keep the mark obtained in the exam, independently of being higher or lower than the test's mark.
Those obtaining a grade higher than 18 in the exam or in the full collection of tests must do an extra short exam to confirm their mark.