Go to:

Site map

Code: | EIC0011 | Acronym: | MDIS |

Keywords | |
---|---|

Classification | Keyword |

OFICIAL | Mathematics |

Active? | Yes |

Responsible unit: | Department of Informatics Engineering |

Course/CS Responsible: | Master in Informatics and Computing Engineering |

Acronym | No. of Students | Study Plan | Curricular Years | Credits UCN | Credits ECTS | Contact hours | Total Time |
---|---|---|---|---|---|---|---|

MIEIC | 219 | Syllabus since 2009/2010 | 1 | - | 6 | 70 | 162 |

Teacher | Responsibility |
---|---|

Gabriel de Sousa Torcato David |

Lectures: | 3,00 |

Recitations: | 2,00 |

Type | Teacher | Classes | Hour |
---|---|---|---|

Lectures | Totals | 1 | 3,00 |

Gabriel de Sousa Torcato David | 3,00 | ||

Recitations | Totals | 8 | 16,00 |

Gabriel de Sousa Torcato David | 2,00 | ||

Gil Coutinho Costa Seixas Lopes | 4,00 | ||

Renato Borges Araujo Moura Soeiro | 6,00 | ||

José Maria Corte Real da Costa Pereira | 4,00 |

**Background**

Logic is the fondament of any scientific reasoning and that is the main reason for its inclusion in the first year of the program. Furthermore, in the case of a Computer Science program, Logic has direct operational relevance in multiple professional aspects.

**Specific aims**

The goals are the development of skills of rigorous reasoning and in the techniques of discrete mathematics required in several areas of computer science like problem solving, algorithm design and analysis, theory of computing, knowledge representation and security.

**Percentual distribution**

Scientific component: 100%

Technological component: 0%.

The skills to be acquired include: (1) representing situations using first order logic and to analyze them both in the models and the proof perspectives; (2) mastering the basic concepts of sets, relations, partial orders, and functions; (3) solving simple problems of number theory, in particular in its application to cryptography; (4) solving modular arithmetic equations; (5) performing inductive proofs; (6) formulating and solving problems through recurrence relations.

Knowledge of elementary mathematics.

Propositional logic. Proof methods in propositional logic. Quantifiers and knowledge representation. Proof methods in first order logic. Sets, relations, and partial orders. Functions. Introduction to number theory. Congruences and modular arithmetic equations. Induction and recursion. Recurrent relations.

Edgar G. Goodaire, Michael M. Parmenter; Discrete mathematics with graph theory. ISBN: 0-13-167995-3

Edward R. Scheinerman; Mathematics: A Discrete Introduction, 3rd ed., Brooks/Cole Cengage Learning, 2013. ISBN: 978-0-8400-6528-5

In theoretical lectures the syllabus topics are presented and application examples are discussed. Practical lectures are devoted to analyzing and solving problems aiming at developing and testing the above mentioned skills, resorting to support software in the logic topics.

Designation | Weight (%) |
---|---|

Participação presencial | 0,00 |

Teste | 100,00 |

Total: |
100,00 |

Designation | Time (hours) |
---|---|

Estudo autónomo | 92,00 |

Frequência das aulas | 70,00 |

Total: |
162,00 |

To get attendance certificate, the student must obtain a global assessment of 7,5 and attend the legal number of lectures. The attendance certificate may, in case of failure, release the student from attending classes on the next year.

Classification = [sum_{i=1,..,4}(T_{i})-0.8*min_{i=1,..,4}(T_{i})]/3.2 , T_{i} - test i classification

Test 1: 2018-10-22

Test 2: 2018-11-19

Test 3: 2018-12-10

Test 4: 2019-01-14

Students whose enrollment type do not require lecture attendance must perform the four tests. Special exams are 3H00 long and cover all the subjects.

The second chance exam scope is on the whole course contents.

This exam can be used for classification improvement.

Copyright 1996-2019 © Faculdade de Engenharia da Universidade do Porto
I Terms and Conditions
I Accessibility
I Index A-Z
I Guest Book

Page generated on: 2019-03-21 at 10:54:36

Page generated on: 2019-03-21 at 10:54:36