Maestría en Ciencias Computacionales

Discrete Mathematics

Summer 2014

Profesor: Dr. Rogelio Dávila Pérez    
General objective of the course: At the end of the course the student will be able to::    
 
  • Reasoning in a formal and rigorous way using the Formal Logic.
  • Use the Mathematical Induction as a method for reasoning and proof theorems.
  • Use Graphs to model data structures.
  • Apply the Mathematical Logic, Graph Theory, Sets, Functions and Relations in the solution of problems.
  • Apply the Mathematical Logic, Graph Theory, Sets, Functions and Relations in the management of data.
  • Recognize the importance of sustaining the solution of problems with fundamental theory and models.
   
Evaluation:
  • First Partial Examination (25%)
  • First exam 90%
  • Activities and Homeworks 10%,
  • Total 100%

  • Second Partial Examination (35%)
  • Second exam 90%
  • Activities and Homeworks 10%,
  • Total 100%


  • Final Examination (40%)
  • Final exam 90%
  • Activities and Homeworks 10%,
  • Total 100%


  • TOTAL EVALUATION
  • 2 partial examinations: 25% + 35% = 60%
  • Final examinationl: 40%,
  • Total: 100%
   
Textbook:
  • Epp, Sussana S., “Discrete Mathematics with Applications”, Last Edition, Thomson Brooks/Cole.
  • Rosen, Kenneth H., “Discrete Mathematics and Its Applications”, 7th Edition, McGraw Hill.