Course
EEE1218970
DISCRETE MATHEMATICS
Electrical and Electronics Engineering
- LECTURE
- 3
- LAB
- 0
- CREDITS
- 3
- ECTS
- 5
REQUIRES
REQUIRED BY
None
TAUGHT IN
AIM
The course is aimed at equipping students with logical and mathematical thinking. The course is designed to accomplish five major themes: (i) Mathematical reasoning, (ii) combinatorial analysis, (iii) discrete structures, (iv) algorithmic thinking, (v) applications and modeling.
CONTENT
This course contains; Fundamentals,Fundamentals of Logic ,Logic, Conditional Statements,Logic of Quantified Statements,Introduction to Number Theory, Direct Proof and Counterexample,Sequences, Mathematical Induction,Strong Induction, Recursion and Structural Induction,Introduction to Set theory,Functions,Cardinality applications to computability,Relation,Equivalence Relation and Modular Arithmetic,Basic Cryptography ,Basic Problems on Graphs and Tree representation,Applications of Graph theory.
LEARNING OUTCOMES
- 1
Determine an argument using logical notation and whether the argument is or not valid
Taught by: Discussion Method, Problem Solving Method, Question - Answer Technique, Lecture Method · Assessed by: Traditional Written Exam, Homework
- 2
Execute proof writing and evaluation.
Taught by: Discussion Method, Problem Solving Method, Question - Answer Technique, Lecture Method · Assessed by: Traditional Written Exam, Homework
- 3
Comprehend set fundamentals, operations, and validation of elementary set equalities.
Taught by: Discussion Method, Problem Solving Method, Question - Answer Technique, Lecture Method · Assessed by: Traditional Written Exam, Homework
- 4
Comprehend the properties of functions, relationships between them, and introductory knowledge of graph theory and cryptology.
Taught by: Discussion Method, Problem Solving Method, Question - Answer Technique, Lecture Method · Assessed by: Traditional Written Exam, Homework
WEEKLY PLAN
- WEEK 1
Fundamentals
Preparation: Chapter
- WEEK 2
Fundamentals of Logic
Preparation: Chapter 2.1
- WEEK 3
Logic, Conditional Statements
Preparation: Chapter 2.2, 2.3
- WEEK 4
Logic of Quantified Statements
Preparation: Chapter 3
- WEEK 5
Introduction to Number Theory, Direct Proof and Counterexample
Preparation: Chapter 4
- WEEK 6
Sequences, Mathematical Induction
Preparation: Chapter 5.1, 5.2
- WEEK 7
Strong Induction, Recursion and Structural Induction
Preparation: Chapter 5
- WEEK 8
Introduction to Set theory
Preparation: Chapter 6.1
- WEEK 8
Functions
Preparation: Chapter 7.1-7.3
- WEEK 9
Cardinality applications to computability
Preparation: Chapter 7.4
- WEEK 10
Relation
Preparation: Chapter 8.1, 8.2
- WEEK 11
Equivalence Relation and Modular Arithmetic
Preparation: Chapter 8.3, 8.4
- WEEK 12
Basic Cryptography
Preparation: Chapter 8.4
- WEEK 13
Basic Problems on Graphs and Tree representation
Preparation: Chapter 10.1-10.5
- WEEK 14
Applications of Graph theory
Preparation: Chapter 10.5, 10.7
ASSESSMENT
- Rate of Midterm Exam to Success30%
- Rate of Final Exam to Success70%
WORKLOAD
| ACTIVITY | COUNT | HOURS | TOTAL |
|---|---|---|---|
| Course Hours | 14 | 3 | 42 |
| Guided Problem Solving | 0 | 0 | 0 |
| Resolution of Homework Problems and Submission as a Report | 0 | 0 | 0 |
| Term Project | 14 | 3 | 42 |
| Presentation of Project / Seminar | 0 | 0 | 0 |
| Quiz | 3 | 5 | 15 |
| Midterm Exam | 1 | 20 | 20 |
| General Exam | 1 | 30 | 30 |
| Performance Task, Maintenance Plan | 0 | 0 | 0 |
READING
- Discrete Mathematics and Its Applications, Kenneth H. Rosen, 7th edition, McGraw-Hill, 2012
TEACHING STAFF
- Assist.Prof. Cihan Bilge GÜRBÜZCOORDINATOR
- Assist.Prof. Cihan Bilge GÜRBÜZ