Skip to main content
TR

DISCRETE MATHEMATICS

Course
MATH122 - DISCRETE MATHEMATICS
Department
Basic Sciences and Humanities
Course Type
Course
Status
Required
Language
English
Credit
3
ECTS
4
T+P+L
3 + 1 + 0
Course Coordinator(s)
Dr. Olabimpe Genevieve BADRU
Prerequisite
-
Keywords

Course Description

The objective of the course is to introduce the students fundamental principles: logic and Boolean algebra, set theory, relations( Partial ordering, Total ordering and Hasse diagrams, Equivalence relations and equivalence classes), functions(one-to-one, onto, identity, inverse and composition of functions), inductive proofs and recurrence relations, counting techniques(multiplication and addition rules, permutations, combinations, unordered samples with repetitions, principle of inclusion and exclusion, pigeonhole principle) and introduction to graph theory(basic terminology like vertex, edge, degree of a vertex in directed and undirected graphs, Eulerian and Hamiltonian graphs, trees and spanning trees, minimal spanning trees, Prim’s Algorithm, Kruskal Algorithms, Shortest Path Problems, Dijkstra’s Algorithm).

DISCRETE MATHEMATICS

Evaluation Tools (Active Term)

Item Type Weight (%)
Midterm Midterm 40
Quiz Quiz 10
Final Final 50
Total 100

Course Syllabus

Week Topic
Week 1 Introduction to Discrete Mathematics
Week 2 Logic Theory
Week 3 Set Theory
Week 4 Relations
Week 5 Functions
Week 6 Recursive Definitions and Recurrence Relations
Week 7 Inductive Proofs.Counting Techniques: The Basics of Counting,
Week 8 MIDTERM EXAM WEEK (21/11/2020-1/12/2020)
Week 9 (2-4/12/2020) Permutations and Combinations
Week 10 Binomial Coefficients and Identities, Generalized Permutations and Combinations,
Week 11 Generalized Permutations and Combinations, Principle of Inclusion and Exclusion
Week 12 Introduction to Graph Theory
Week 13 Eulerian Graphs, Representing Graphs and Adjacency Matricies
Week 14 Representing Graphs and Spanning Trees
Week 15 Minimal Spanning Trees and Applications

Reference Books & Course Materials

  1. 01 Susanna S. Epp; Discrete Mathematics with Applications, 4th edition, Brooks/Cole Cengage Learning, 2011(ISBN-13:978-0-495-82616-3)
  2. 02 Rosen K.; Discrete Mathematics & Its Applications, Seventh edition, McGraw Hill, 2012(ISBN:978-0-07-338309-5)
  3. 03 McEliece J.R., Ash B.R, Ash C.; Introduction to Discrete Mathematics, McGraw Hill, 1989(ISBN:0-07-100202-2
  4. 04 Ferland K.; Discrete Mathematics, Brooks/Cole Cengage Learning, 2009(ISBN-13:978-0-495-83174-7)

Learning Outcomes

  1. L01 1. Explain the basic terminology of functions, relations and sets and write examples.
  2. L02 2. Identify formal tools of logic theory .
  3. L03 3. Use counting techniques in particular application problems.
  4. L04 4. Exemplify graphs and trees in graph theory.
  5. L05 5. Apply minimal spanning algorithms to real life problems.

Program Outcomes

  1. P01 Should have sufficient knowledge in mathematics, science, and subjects specific to the relevant engineering discipline.
  2. P02 Should have the ability to use theoretical and applied knowledge in mathematics, science, and related engineering disciplines in complex engineering problems.
  3. P03 Should have the ability to detect, define, formulate, and solve complex engineering problems.
  4. P04 Should have the ability to select and apply appropriate analysis and modeling methods to solve complex engineering problems.
  5. P05 Should have the ability to design a complex system, process, device, or product to meet specific requirements under realistic constraints and conditions.
  6. P06 Should have the ability to apply modern design methods.
  7. P07 Should have the ability to develop, select, and use modern techniques and tools necessary for the analysis and solution of complex problems encountered in engineering applications.
  8. P08 Should have the ability to use information technologies effectively.
  9. P09 Should have the ability to design experiments, for the study of complex problems or discipline-specific research topics.
  10. P10 Should have the ability to conduct experiments, collect data, analyze and interpret results for the study of complex problems or discipline-specific research topics.
  11. P11 Should have the ability to work in intradisciplinary teams.
  12. P12 Should have the ability to work in interdisciplinary teams.
  13. P13 Should have the skills to work individually.
  14. P14 Should have the ability to communicate effectively verbally and in writing.
  15. P15 Should have the knowledge of at least one foreign language.
  16. P16 Should be able to write effective reports, understand written reports, and prepare design and production reports.
  17. P17 Should have the ability to make effective presentations.
  18. P18 Should have the ability to give and have clear and understandable instructions.
  19. P19 Should gain consciousness (awareness) about the necessity of lifelong learning.
  20. P20 Should have the ability to access information.
  21. P21 Should have the ability to follow developments in science and technology and constantly renew himself/herself.
  22. P22 Should gain the awareness of professional and ethical responsibility and should act in accordance with ethical principles.
  23. P23 Should gain knowledge about the standards used in engineering applications.
  24. P24 Should gain knowledge about project management, risk management, and change management practices in business life.
  25. P25 Should gain awareness about entrepreneurship, and innovation.
  26. P26 Should gain knowledge about development in sustainability.
  27. P27 Should gain knowledge about the effects of engineering practices on health, environment, and security at universal and social dimensions and the problems of the age reflected in the field of engineering.
  28. P28 Awareness should be gained about the legal consequences of engineering solutions.

Po-Lo Matrix

LO P01 P02 P03 P04 P05 P06 P07 P08 P09 P10 P11 P12 P13 P14 P15 P16 P17 P18 P19 P20 P21 P22 P23 P24 P25 P26 P27 P28 Average
L01 - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
L02 - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
L03 - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
L04 - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
L05 - - - - - - - - - - - - - - - - - - - - - - - - - - - - -