Bilgi Paketi / Ders Kataloğu
| Bilgisayar Mühendisliği | |||||
| Lisans | Programın Süresi: 4 | Kredi Sayısı: 240 | TYYÇ: 6. Düzey | QF-EHEA: 1. Düzey | EQF: 6. Düzey |
Ders Genel Tanıtım Bilgileri
| School/Faculty/Institute | Faculty of Engineering | ||||
| Course Code | MATH 108 | ||||
| Course Title in English | Discrete and Combinatorial Mathematics | ||||
| Course Title in Turkish | Ayrık ve Kombinatorik Matematik | ||||
| Language of Instruction | EN | ||||
| Type of Course | Flipped Classroom | ||||
| Level of Course | Introductory | ||||
| Semester | Bahar | ||||
| Contact Hours per Week |
|
||||
| Estimated Student Workload | 130 hours per semester | ||||
| Number of Credits | 5 ECTS | ||||
| Grading Mode | Standard Letter Grade | ||||
| Pre-requisites | None | ||||
| Expected Prior Knowledge | None | ||||
| Co-requisites | None | ||||
| Registration Restrictions | Only Undergraduate Students | ||||
| Overall Educational Objective | To learn and understand the foundations of mathematics of computer science, develop analytical and critical thinking abilities and deduce mathematical and logical proofs. | ||||
| Course Description | Topics to be covered include set theory, mathematical induction, relations and functions, basic counting and probability, recursion and recurrence relations, graph theory and trees and related algorithms, algorithm complexity, and modular arithmetic. | ||||
| Course Description in Turkish | Dersin konuları, kümeler kuramı, tümevarım, bağıntı ve fonksiyonlar, temel olasılık ve sayma kuramı, özyineleme ve özyinelemeli bağıntılar, çizge ve ağaç yapıları ve ilgili algoritmalar, algoritma analizi ve modüler aritmetik içermektedir. |
Course Learning Outcomes and CompetencesUpon successful completion of the course, the learner is expected to be able to:1) Use logical notation to define and reason about sets, understand relations and functions (logic/set theory). 2) Solve problems in modular arithmetic and to know the fundamental algorithms in number theory and explain their applications in Computer. Science, for example, in cryptography 3) Understand graph theory, trees and related algorithms. 4) Analyze mathematical logic, and be able to operate on Boolean algebra and understand the basics of proof techniques. 5) apply counting and probability. |
| Program Learning Outcomes/Course Learning Outcomes | 1 | 2 | 3 | 4 | 5 |
|---|---|---|---|---|---|
| 1) An ability to identify, formulate, and solve complex engineering problems by applying principles of engineering, science, and mathematics | |||||
| 2) An ability to apply engineering design to produce solutions that meet specified needs with consideration of public health, safety, and welfare, as well as global, cultural, social, environmental, and economic factors | |||||
| 3) An ability to communicate effectively with a range of audiences | |||||
| 4) An ability to recognize ethical and professional responsibilities in engineering situations and make informed judgments, which must consider the impact of engineering solutions in global, economic, environmental, and societal contexts | |||||
| 5) An ability to function effectively on a team whose members together provide leadership, create a collaborative and inclusive environment, establish goals, plan tasks, and meet objectives | |||||
| 6) An ability to develop and conduct appropriate experimentation, analyze and interpret data, and use engineering judgment to draw conclusions | |||||
| 7) An ability to acquire and apply new knowledge as needed, using appropriate learning strategies. |
Relation to Program Outcomes and Competences
| N None | S Supportive | H Highly Related |
| Program Outcomes and Competences | Level | Assessed by | |
| 1) | An ability to identify, formulate, and solve complex engineering problems by applying principles of engineering, science, and mathematics | H | Exam |
| 2) | An ability to apply engineering design to produce solutions that meet specified needs with consideration of public health, safety, and welfare, as well as global, cultural, social, environmental, and economic factors | N | |
| 3) | An ability to communicate effectively with a range of audiences | N | |
| 4) | An ability to recognize ethical and professional responsibilities in engineering situations and make informed judgments, which must consider the impact of engineering solutions in global, economic, environmental, and societal contexts | N | |
| 5) | An ability to function effectively on a team whose members together provide leadership, create a collaborative and inclusive environment, establish goals, plan tasks, and meet objectives | N | |
| 6) | An ability to develop and conduct appropriate experimentation, analyze and interpret data, and use engineering judgment to draw conclusions | N | |
| 7) | An ability to acquire and apply new knowledge as needed, using appropriate learning strategies. | N |
| Prepared by and Date | ŞENİZ DEMİR , November 2023 |
| Course Coordinator | ŞENİZ DEMİR |
| Semester | Bahar |
| Name of Instructor | Dr. Öğr. Üyesi FUNDA ÖZDEMİR |
Course Contents
| Hafta | Konu |
| 1) | Foundations: Logic |
| 2) | Foundations: Quantifiers, Arguments |
| 3) | Introduction to proofs |
| 4) | Relations and Functions |
| 5) | Sequences and Summations |
| 6) | Algorithms: Basics |
| 7) | Algorithm Analysis |
| 8) | Number Theory: Modular Arithmetic, Prime Numbers |
| 9) | Number Theory: Fundamental Algorithms |
| 10) | Counting and Probability |
| 11) | Advanced Counting |
| 12) | Recursion and Induction |
| 13) | Recurrence Relations |
| 14) | Graph Theory and Trees |
| 15) | Final Exam/Project/Presentation |
| 16) | Final Exam/Project/Presentation |
| Required/Recommended Readings | Discrete Mathematics and Its Applications, Kenneth Rosen, 7th Edition, 2011 Supplementary Textbook: Discrete and Combinatorial Mathematics, R. P. Grimaldi, Addison-Wesley, 2004 | ||||||||||||
| Teaching Methods | Lecturing. Independent study for students | ||||||||||||
| Homework and Projects | Pre-class Practices, In-class Practices | ||||||||||||
| Laboratory Work | None | ||||||||||||
| Computer Use | Required | ||||||||||||
| Other Activities | Not required. | ||||||||||||
| Assessment Methods |
|
||||||||||||
| Course Administration |
demirse@mef.edu.tr 536 Assoc. Prof. Şeniz Demir Instructor’s office: 5th floor, Exams: Closed book and closed notes. Rules for attendance: YÖK regulations. Missing a midterm: You are expected to be present without exception and to plan any travel around these dates accordingly. Medical emergencies are of course excluded if accompanied by a doctor’s note. A note indicating that you were seen at the health center on the day of the midterm/quiz is not a sufficient documentation of medically excused absence from the midterm/quiz. The note must say that you were medically unable to take the midterm/quiz. Provided that proper documents of excuse are presented, a make-up for the missing midterm/quiz will be given. If you fail to take the midterm/quiz on the assigned day and do not have a valid excuse, you will be given zero (0) on the midterm/quiz. Employment interviews, employer events, weddings, vacations, etc. are not excused absences. Eligibility to take the final exam: No final exam. Missing a final: No final exam. A reminder of proper classroom behavior, code of student conduct: YÖK Regulations Statement on plagiarism: YÖK Regulations |
||||||||||||
ECTS Student Workload Estimation
| Activity | No/Weeks | Hours | Calculation | ||||
| No/Weeks per Semester | Preparing for the Activity | Spent in the Activity Itself | Completing the Activity Requirements | ||||
| Ders Saati | 14 | 1 | 3 | 1 | 70 | ||
| Küçük Sınavlar | 8 | 1 | 1 | 16 | |||
| Ara Sınavlar | 2 | 20 | 2 | 44 | |||
| Total Workload | 130 | ||||||
| Total Workload/25 | 5.2 | ||||||
| ECTS | 5 | ||||||