ISMAT 1656

Discrete Mathematics

• ApresentaçãoPresentation

  This course of the mathematics field focuses on the fundamental concepts of discrete mathematics. The topics adressed are the elements of cardinals and combinatorial calculus; summation, mathematical induction and binomial expansion; relations; formal languages, grammars and finite automata and an introduction to graph theory. The contents and teaching / learning strategies addressed promote the development of skills to better understand and develop IT engineering projects.
• ProgramaProgramme

  CP1: Elements of cardinals and combinatorial calculus; CP2: Summations, mathematical induction and binomial expansion; CP3: Mathematical relations; CP4: Elements of graph theory. CP5: Formal languages, grammars and finite automata.
• ObjectivosObjectives

  At the end of this unit the students must be able to: OA1. Recognize the concepts of cardinals and combinatorial calculus and use the problem solving of these domains; OA2. Formulate and solve real-world problems using summations, mathematical induction and binomial expansion; OA3. Recognize the concepts of relationship and perform operations on relationships; OA4: Recognize the concepts about formed, grammatical, self-financed languages and used in solving problems related to domains; OA5: Relate the elements of the the graph theory with the computer sciente theory.
• BibliografiaBibliography

  A. J. Franco de Oliveira, Teoria de Conjuntos, 4ª ed., Escolar Editora, 1982. D. M. Burton, Elementary Number Theory, 7ª ed, McGraw-Hill, 2010. R. J. Wilson, Introduction to Graph Theory, 4ª ed., Addison Wesley, 1996. B. Kolman, R. C. Busby, S. Ross, Discrete Mathematical Structures, 3ª ed., Prentice Hall, 1996.  
• MetodologiaMethodology

  São utilizados os métodos expositivo, demonstrativo e metodologias ativas orientadas à resolução de problemas.
• LínguaLanguage

  Português
• TipoType

  Semestral
• ECTS

  6
• NaturezaNature

  Mandatory
• EstágioInternship

  Não