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 outcomes
- 01 1. Explain the basic terminology of functions, relations and sets and write examples.
- 02 2. Identify formal tools of logic theory .
- 03 3. Use counting techniques in particular application problems.
- 04 4. Exemplify graphs and trees in graph theory.
- 05 5. Apply minimal spanning algorithms to real life problems.
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
- 01 Susanna S. Epp; Discrete Mathematics with Applications, 4th edition, Brooks/Cole Cengage Learning, 2011(ISBN-13:978-0-495-82616-3)
- 02 Rosen K.; Discrete Mathematics & Its Applications, Seventh edition, McGraw Hill, 2012(ISBN:978-0-07-338309-5)
- 03 McEliece J.R., Ash B.R, Ash C.; Introduction to Discrete Mathematics, McGraw Hill, 1989(ISBN:0-07-100202-2
- 04 Ferland K.; Discrete Mathematics, Brooks/Cole Cengage Learning, 2009(ISBN-13:978-0-495-83174-7)
Learning Outcomes
- L01 1. Explain the basic terminology of functions, relations and sets and write examples.
- L02 2. Identify formal tools of logic theory .
- L03 3. Use counting techniques in particular application problems.
- L04 4. Exemplify graphs and trees in graph theory.
- L05 5. Apply minimal spanning algorithms to real life problems.
Program Outcomes
- P01 Adequate knowledge in mathematics, science and engineering subjects pertaining to the relevant discipline; ability to use theoretical and applied knowledge in these areas in complex engineering problems.
- P02 Ability to identify, formulate, and solve complex engineering problems; ability to select and apply proper analysis and modelling methods for this purpose.
- P03 Ability to design a complex system, process, device or product under realistic constraints and conditions, in such a way as to meet the desired result; ability to apply modern design methods for this purpose.
- P04 Ability to devise, select, and use modern techniques and tools needed for analysing and solving complex problems encountered in engineering practice; ability to employ information technologies effectively
- P05 Ability to design and conduct experiments, gather data, analyse and interpret results for investigating complex engineering problems or discipline specific research questions.
- P06 Ability to work efficiently in intra-disciplinary and multi-disciplinary teams; ability to work individually.
- P07 Ability to communicate effectively in Turkish, both orally and in writing; knowledge of a minimum of one foreign language; ability to write effective reports and comprehend written reports, prepare design and production reports, make effective presentations, and give and receive clear and intelligible instructions.
- P08 Recognition of the need for lifelong learning ; ability to access information, to follow developments in science and technology, and to continue to educate him/herself.
- P09 Consciousness to behave according to ethical principles and professional and ethical responsibility; knowledge on standards used in engineering practice.
- P10 Knowledge about business life practices such as project management, risk management, and change management; awareness in entrepreneurship, innovation; knowledge about sustainable development.
- P11 Knowledge about the global and social effects of engineering practices on health, environment, and safety, and contemporary issues of the century reflected into the field of engineering; awareness of the legal consequences of engineering solutions.
Po-Lo Matrix
| LO | P01 | P02 | P03 | P04 | P05 | P06 | P07 | P08 | P09 | P10 | P11 | Average |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| L01 | - | - | - | - | - | - | - | - | - | - | - | - |
| L02 | - | - | - | - | - | - | - | - | - | - | - | - |
| L03 | - | - | - | - | - | - | - | - | - | - | - | - |
| L04 | - | - | - | - | - | - | - | - | - | - | - | - |
| L05 | - | - | - | - | - | - | - | - | - | - | - | - |