Course Unit Code | Course Unit Title | Type of Course Unit | Year of Study | Semester | Number of ECTS Credits | 190105003102 | BREAKED MATHEMATICS | Compulsory | 2 | 3 | 4 |
|
Level of Course Unit |
First Cycle |
Objectives of the Course |
Students should learn a special set of mathematical relations and how they are applied. The course is intended to teach logical and mathematical thinking. Mathematical reasoning, combinatorial analysis, discrete structures, algorithmic thinking, application and modelling are the main themes of this course. |
Name of Lecturer(s) |
Prof. Dr. İhsan Ömür BUCAK |
Learning Outcomes |
1 | The student will be able to develop the ability to understand and create mathematical justifications through this course. | 2 | This course provides the mathematical foundations for many computer science courses, including data structures, algorithms, database theory, automata theory, formal languages, compiler theory, computer security, and operating systems. | 3 | In order to be successful in developing their problem-solving skills, students are taught how to tackle problems that are slightly different from any problem they have seen before. |
|
Mode of Delivery |
Daytime Class |
Prerequisites and co-requisities |
None |
Recommended Optional Programme Components |
Algorithms are also given to the students, even if not as a department in itself, but interspersed in other departments. Moreover, our students are given two separate courses related to Algorithms in the curriculum. |
Course Contents |
Sets, Relations, Functions; Mathematical Induction and Recursion; Sequences, Permutations and Combinations; Graphs and Graph Theory; Trees; Number Theory and Cryptography; Propositional Logic and Predicate Logic. |
Weekly Detailed Course Contents |
|
1 | Sets and Relationships | In the course, especially examples suitable for Computer Science are covered and the homework questions given to the students are also from the field of Computer Engineering. | | 2 | Functions | In the course, especially examples suitable for Computer Science are covered and the homework questions given to the students are also from the field of Computer Engineering. | | 3 | Mathematical Induction | In the course, especially examples suitable for Computer Science are covered and the homework questions given to the students are also from the field of Computer Engineering. | | 4 | Recursion | In the course, especially examples suitable for Computer Science are covered and the homework questions given to the students are also from the field of Computer Engineering. | | 5 | Sequences and Series | In the course, especially examples suitable for Computer Science are covered and the homework questions given to the students are also from the field of Computer Engineering. | | 6 | Permutations and Combinations | In the course, especially examples suitable for Computer Science are covered and the homework questions given to the students are also from the field of Computer Engineering. | | 7 | Graphs and Graph Theory | In the course, especially examples suitable for Computer Science are covered and the homework questions given to the students are also from the field of Computer Engineering. | | 8 | Graphs and Graph Theory (Continued) | In the course, especially examples suitable for Computer Science are covered and the homework questions given to the students are also from the field of Computer Engineering. | | 9 | Trees | In the course, especially examples suitable for Computer Science are covered and the homework questions given to the students are also from the field of Computer Engineering. | | 10 | Trees (Continued) | In the course, especially examples suitable for Computer Science are covered and the homework questions given to the students are also from the field of Computer Engineering. | | 11 | Number Theory | In the course, especially examples suitable for Computer Science are covered and the homework questions given to the students are also from the field of Computer Engineering. | | 12 | Cryptography | In the course, especially examples suitable for Computer Science are covered and the homework questions given to the students are also from the field of Computer Engineering. | | 13 | Propositional Logic | In the course, especially examples suitable for Computer Science are covered and the homework questions given to the students are from the field of Computer Engineering. | | 14 | Predicate Logic | | |
|
Recommended or Required Reading |
Ayrık Matematik ve Uygulamaları, Kenneth H. Rosen, Çeviri Editörleri: Prof. Dr. Ömer Akın, Doç. Dr. Murat Özbayoğlu, Yedinci baskıdan Çeviri, Palme Yayınevi, Ankara, 2020 |
Planned Learning Activities and Teaching Methods |
|
Assessment Methods and Criteria | |
Midterm Examination | 1 | 50 | Homework | 2 | 50 | SUM | 100 | |
Final Examination | 1 | 100 | SUM | 100 | Term (or Year) Learning Activities | 60 | End Of Term (or Year) Learning Activities | 40 | SUM | 100 |
| Language of Instruction | Turkish | Work Placement(s) | None |
|
Workload Calculation |
|
Midterm Examination | 1 | 1 | 1 |
Final Examination | 1 | 2 | 2 |
Self Study | 14 | 4 | 56 |
Individual Study for Mid term Examination | 1 | 12 | 12 |
Individual Study for Final Examination | 1 | 24 | 24 |
Homework | 2 | 5 | 10 |
|
Contribution of Learning Outcomes to Programme Outcomes |
LO1 | 5 | 5 | 4 | 5 | 3 | 4 | 4 | 4 | 5 | 4 | 3 | 4 | 4 | LO2 | 5 | 4 | 4 | 4 | 5 | 4 | 5 | 4 | 5 | 4 | 4 | 4 | 4 | LO3 | 4 | 4 | 5 | 4 | 4 | 4 | 4 | 4 | 5 | 4 | 4 | 4 | 3 |
|
* Contribution Level : 1 Very low 2 Low 3 Medium 4 High 5 Very High |
|
|
Iğdır University, Iğdır / TURKEY • Tel (pbx): +90 476
226 13 14 • e-mail: info@igdir.edu.tr
|