Algorithms in Discrete Mathematics
Keywords |
Classification |
Keyword |
OFICIAL |
Mathematics |
Instance: 2023/2024 - 1S
Cycles of Study/Courses
Teaching language
Suitable for English-speaking students
Objectives
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.
Learning outcomes and competences
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.
• Be able to use computational tools to solve problems.
Working method
Presencial
Program
1. Revision of some basic principles of combinatorics: counting, listing, ordering, permutations.
2. Decision trees and recursion: basic definitions, order, rank, depth-first and breadth first; recursive algorithms, sorting,
3. Introduction to graph theory: definitions and examples, isomorphism, random graphs; digraphs and flows; Euler circuits and hamiltonian cycles; trees,
4. Introduction to the analysis of algorithms like Sorting and Searching algorithms, the algorithms of Prime, of Kruskal, of Dijkstra, greedy algorithm and the Ford-Fulkerson method.
Mandatory literature
Dieter Jungnickel;
Graphs, networks and algorithms. ISBN: 978-3-540-72779-8
Bender Edward A. 1942-;
Mathematics for algorithm and systems analysis
Complementary Bibliography
Bondy J. A.;
Graph theory with applications. ISBN: 0-333-17791-6
Cormen Thomas H.;
Introduction to algorithms. ISBN: 9780262031417 hbk
Sedgewick Robert 1946-;
An introduction to the analysis of algorithms. ISBN: 978-0-201-40009-0
Teaching methods and learning activities
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.
Software
SageMath
keywords
Physical sciences > Mathematics > Algorithms
Physical sciences > Mathematics > Combinatorial analysis
Evaluation Type
Distributed evaluation with final exam
Assessment Components
designation |
Weight (%) |
Teste |
100,00 |
Total: |
100,00 |
Amount of time allocated to each course unit
designation |
Time (hours) |
Estudo autónomo |
114,00 |
Frequência das aulas |
48,00 |
Total: |
162,00 |
Eligibility for exams
Without requirements.
Calculation formula of final grade
final grade = max((T1+T2)/2, E)
where T_i is the grade of the ith quiz and E is the grade of the final exam in the normal exam period.
The quizzes will take place during lecture time.
The makeup exame will have two parts in order to improve the grades from each of the quizzes. More precisely, the students can choose to keep the grade of one of the quizzes.
Observations
Article 13 of General Regulations for Student Evaluation at the levels of First Cycle, Integrated Masters, and Second Cycle at U.Porto, approved on May 19, 2010 (cf. http://www.fc.up.pt/fcup/documentos/documentos.php?ap=3&ano=2011): "Fraud committed during an exam, in any form, implies the annulment of the exam and the communication to the statutorily competent organ for possible disciplinary action."
Any student may be required to take an oral examination should there be any doubts concerning his/her performance on the assessment pieces.