Faculty Of Engıneerıng
Computer And Software Engıneerıng
Course Information
| DISCRETE MATHEMATICS | |||||
|---|---|---|---|---|---|
| Code | Semester | Theoretical | Practice | National Credit | ECTS Credit |
| Hour / Week | |||||
| MAT204 | Spring | 3 | 0 | 3 | 4 |
| Prerequisites and co-requisites | None |
|---|---|
| Language of instruction | English |
| Type | Required |
| Level of Course | Bachelor's |
| Lecturer | Asst. Prof. Ziya Gökalp Altun |
| Mode of Delivery | Face to Face |
| Suggested Subject | None |
| Professional practise ( internship ) | None |
| Objectives of the Course | To give Information abut the discrete structures and basics of discrete mathematic. Describe applications of discrete mathematics in computer science, to maintain understanding students this relationship |
| Contents of the Course | Introduction to Discrete Mathemtaics, set theory, Mathematical Proof techniques, Logical methods, Boolean Algebra and functions, Algorithms |
Learning Outcomes of Course
| # | Learning Outcomes |
|---|---|
| 1 | Define the discrete structures and basics of discrete mathematics. |
| 2 | Interpret computer applications of discrete mathematics |
| 3 | Analyze discrete structures |
| 4 | Define and analyze engineering problems by using the mathematics, scientific and engineering knowledge |
Course Syllabus
| # | Subjects | Teaching Methods and Technics |
|---|---|---|
| 1 | Introduction to Discrete Mathematics, Propsitional logic and proof techniques | Lecture, discussion, exam |
| 2 | Mathematical Proof techniques, Set theory (Problems) | Lecture, discussion, exam |
| 3 | Operations on sets | Lecture, discussion, exam |
| 4 | Relations and operations | Lecture, discussion, exam |
| 5 | Relations and operations, Functions | Lecture, discussion, exam |
| 6 | Functions - Applications (problems) | Lecture, discussion, exam |
| 7 | Algebraic structures | Lecture, discussion, exam |
| 8 | Midterm | Exam |
| 9 | Lattice structuras and Boolean algebra | Lecture, discussion, exam |
| 10 | Boolean functions, applications (problems) | Lecture, discussion, exam |
| 11 | Graph Theory - Applications | Lecture, discussion, exam |
| 12 | Algorithms | Lecture, discussion, exam |
| 13 | Algorithm applications (problems) | Lecture, discussion, exam |
| 14 | Finite state machines, acceptors, transducers, turing machines | Lecture, discussion, exam |
| 15 | ||
| 16 | Final Exam | Exam |
Course Syllabus
| # | Material / Resources | Information About Resources | Reference / Recommended Resources |
|---|---|---|---|
| 1 | Kenneth H.Rosen, Disrete Mathematics and Its applications, Mc.Graw Hill |
Method of Assessment
| # | Weight | Work Type | Work Title |
|---|---|---|---|
| 1 | 40% | Mid-Term Exam | Mid-Term Exam |
| 2 | 60% | Final Exam | Final Exam |
Relationship between Learning Outcomes of Course and Program Outcomes
| # | Learning Outcomes | Program Outcomes | Method of Assessment |
|---|---|---|---|
| 1 | Define the discrete structures and basics of discrete mathematics. | 1͵2͵3 | 1͵2 |
| 2 | Interpret computer applications of discrete mathematics | 1͵2͵4 | 1͵2 |
| 3 | Analyze discrete structures | 1͵2͵4 | 1͵2 |
| 4 | Define and analyze engineering problems by using the mathematics, scientific and engineering knowledge | 1͵2͵4 | 1͵2 |
Work Load Details
| # | Type of Work | Quantity | Time (Hour) | Work Load |
|---|---|---|---|---|
| 1 | Course Duration | 14 | 3 | 42 |
| 2 | Course Duration Except Class (Preliminary Study, Enhancement) | 14 | 2 | 28 |
| 3 | Presentation and Seminar Preparation | 0 | 0 | 0 |
| 4 | Web Research, Library and Archival Work | 0 | 0 | 0 |
| 5 | Document/Information Listing | 0 | 0 | 0 |
| 6 | Workshop | 0 | 0 | 0 |
| 7 | Preparation for Midterm Exam | 1 | 5 | 5 |
| 8 | Midterm Exam | 1 | 5 | 5 |
| 9 | Quiz | 0 | 0 | 0 |
| 10 | Homework | 1 | 5 | 5 |
| 11 | Midterm Project | 0 | 0 | 0 |
| 12 | Midterm Exercise | 0 | 0 | 0 |
| 13 | Final Project | 0 | 0 | 0 |
| 14 | Final Exercise | 0 | 0 | 0 |
| 15 | Preparation for Final Exam | 1 | 5 | 5 |
| 16 | Final Exam | 1 | 5 | 5 |
| 95 | ||||