Industrial Engineering | |||||
Bachelor | TR-NQF-HE: Level 6 | QF-EHEA: First Cycle | EQF-LLL: Level 6 |
Course Code: | FEC104 | ||||||||
Ders İsmi: | Discrete Mathematics | ||||||||
Ders Yarıyılı: | Spring | ||||||||
Ders Kredileri: |
|
||||||||
Language of instruction: | Turkish | ||||||||
Ders Koşulu: | |||||||||
Ders İş Deneyimini Gerektiriyor mu?: | No | ||||||||
Type of course: | Required | ||||||||
Course Level: |
|
||||||||
Mode of Delivery: | E-Learning | ||||||||
Course Coordinator : | Asst. Prof. Dr. BAHAR YALÇIN KAVUŞ | ||||||||
Course Lecturer(s): |
Assoc. Prof. Dr. CEVAT RAHEBİ Asst. Prof. Dr. MELİSA RAHEBİ |
||||||||
Course Assistants: |
Course Objectives: | The course covers basic mathematical definitions and their computer science and engineering applications. By the end of the course, students are supposed to be equipped with a relationship between theoretical mathematics and practical computer science and engineering. |
Course Content: | Propositions, relations, operations with propositions and Boolean algebra, basic counting rules and examples, proof by induction and series addition, recursive function definitions, sets, functions and relations, Graph theory, Trees and Algorithms. |
The students who have succeeded in this course;
|
Week | Subject | Related Preparation |
1) | Number Bases; Expressions and transformations in base 2, 8, 10 and 16, modular arithmetic and applications | |
2) | Introduction to logic, simple and compound propositions | |
3) | Propositions and logical relations | |
4) | Boolean Algebra; impressions | |
5) | Simple circuits with simplification techniques and gates | |
6) | Introduction to mathematical proofs and proof methods | |
7) | Methods of proof by induction | |
8) | Midterm | |
9) | Proof methods with recursion; axioms. Algorithms | |
10) | Set theory | |
11) | Functions, Sums, and Series Complexity | |
12) | Vector and matrices | |
13) | Operations with relationships and relationship matrices | |
14) | Trees, Graphs and their applications | |
15) | Final exam |
Course Notes / Textbooks: | Logic and Discrete Mathematics: A Computer Science Perspective, W. K. Grassmann, J. P. Tremblay Discrete Mathematics and Its Applications, K. H. Rosen Sets, Functions, and Logic: An Introduction to Abstract Mathematics, K. Devlin |
References: | Logic and Discrete Mathematics: A Computer Science Perspective, W. K. Grassmann, J. P. Tremblay Discrete Mathematics and Its Applications, K. H. Rosen Sets, Functions, and Logic: An Introduction to Abstract Mathematics, K. Devlin |
Ders Öğrenme Kazanımları | 1 |
2 |
3 |
4 |
5 |
---|---|---|---|---|---|
Program Outcomes |
No Effect | 1 Lowest | 2 Low | 3 Average | 4 High | 5 Highest |
Program Outcomes | Level of Contribution |
Semester Requirements | Number of Activities | Level of Contribution |
Midterms | 1 | % 50 |
Final | 1 | % 50 |
total | % 100 | |
PERCENTAGE OF SEMESTER WORK | % 50 | |
PERCENTAGE OF FINAL WORK | % 50 | |
total | % 100 |