|
|
| MAT1013 | Basic Mathematics | 4+2+0 | ECTS:9 | | Year / Semester | Fall Semester | | Level of Course | First Cycle | | Status | Compulsory | | Department | DEPARTMENT of MATHEMATICS | | Prerequisites and co-requisites | None | | Mode of Delivery | Face to face | | Contact Hours | 14 weeks - 4 hours of lectures and 2 hours of practicals per week | | Lecturer | Prof. Dr. Sultan YAMAK | | Co-Lecturer | DOCTOR LECTURER Şerife YILMAZ, | | Language of instruction | Turkish | | Professional practise ( internship ) | None | | | | The aim of the course: | | Teach the language and basic concepts of mathematics . |
| Learning Outcomes | CTPO | TOA | | Upon successful completion of the course, the students will be able to : | | | | LO - 1 : | They can learn the language of proposition and how to use proposition in mathematics. | 1,2,8 | 1, | | LO - 2 : | They can realize notion of set, function, bijection. | 1,2,8 | 1, | | LO - 3 : | They can learn the notion of equipollent. | 1,2,8 | 1, | | LO - 4 : | They will recognise the notion of relation and some special relation. | 1,2,8 | 1, | | CTPO : Contribution to programme outcomes, TOA :Type of assessment (1: written exam, 2: Oral exam, 3: Homework assignment, 4: Laboratory exercise/exam, 5: Seminar / presentation, 6: Term paper), LO : Learning Outcome | | |
| Propositions, conjunctions, Truth tables, Logical Equality, İmplication, Proof Methods, Quantifiers, Sets, Cartesian Product, Relation, Inverse relation, Functions, Bijections, Compound Function, Equipollent Sets, Denumerability, Equivalence relations, Equivalence Class and decompositions, Quotient Set, Order Relation, Total order, Well Ordering, Mathematical Induction and recursion theorem of function. |
| |
| Course Syllabus | | Week | Subject | Related Notes / Files | | Week 1 | Propositions and Proof Methods | | | Week 2 | Quantifiers | | | Week 3 | Set Theory, Intersection, union, difference of sets | | | Week 4 | Family of sets and decompositions | | | Week 5 | Cartesian Product of sets and relations | | | Week 6 | Functions | | | Week 7 | Bijections | | | Week 8 | Compound Function | | | Week 9 | Mid Term Exam | | | Week 10 | Equipollence of sets | | | Week 11 | Denumerability of sets | | | Week 12 | Equivalence relations | | | Week 13 | Decomposition and quotient set | | | Week 14 | Order relation, total order, well ordering | | | Week 15 | Mathematical Induction and Recursion Theorem. | | | Week 16 | Final Exam | | | |
| 1 | Seymour Lipschutz, 1981Theory and Problems of Set Theory and Related Topics, Schaum?s Outline Series, McGraw-Hill. | | | |
| 1 | Grimaldi, Ralph, P., 1993, Discrete and Combinatorial Mathematics, An Applied Introduction, Third Edition, Addison-Wesley Publishing Company. | | | 2 | Alpay, Ş., Karakaş, H. İ., 1979, An introduction to Modern Mathematics, METU. | | | |
| Method of Assessment | | Type of assessment | Week No | Date | Duration (hours) | Weight (%) | | Mid-term exam | 9 | 11/2024 | 1,5 | 50 | | End-of-term exam | 16 | 01/2025 | 1,5 | 50 | | |
| Student Work Load and its Distribution | | Type of work | Duration (hours pw) | No of weeks / Number of activity | Hours in total per term | | Yüz yüze eğitim | 4 | 14 | 56 | | Sınıf dışı çalışma | 8 | 14 | 112 | | Arasınav için hazırlık | 10 | 1 | 10 | | Arasınav | 2 | 1 | 2 | | Uygulama | 2 | 14 | 28 | | Ödev | 2 | 6 | 12 | | Dönem sonu sınavı için hazırlık | 18 | 1 | 18 | | Dönem sonu sınavı | 2 | 1 | 2 | | Total work load | | | 240 |
|