Description of Individual Course Units
Course Unit CodeCourse Unit TitleType of Course UnitYear of StudySemesterNumber of ECTS Credits
190105003102BREAKED MATHEMATICSCompulsory234
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
1The student will be able to develop the ability to understand and create mathematical justifications through this course.
2This 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.
3In 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
WeekTheoreticalPracticeLaboratory
1Sets and RelationshipsIn 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.
2FunctionsIn 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.
3Mathematical InductionIn 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.
4RecursionIn 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.
5Sequences and SeriesIn 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.
6Permutations and CombinationsIn 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.
7Graphs and Graph TheoryIn 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.
8Graphs 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.
9TreesIn 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.
10Trees (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.
11Number TheoryIn 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.
12CryptographyIn 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.
13Propositional LogicIn 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.
14Predicate 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
Term (or Year) Learning ActivitiesQuantityWeight
Midterm Examination150
Homework250
SUM100
End Of Term (or Year) Learning ActivitiesQuantityWeight
Final Examination1100
SUM100
Term (or Year) Learning Activities60
End Of Term (or Year) Learning Activities40
SUM100
Language of Instruction
Turkish
Work Placement(s)
None
Workload Calculation
ActivitiesNumberTime (hours)Total Work Load (hours)
Midterm Examination111
Final Examination122
Self Study14456
Individual Study for Mid term Examination11212
Individual Study for Final Examination12424
Homework2510
TOTAL WORKLOAD (hours)105
Contribution of Learning Outcomes to Programme Outcomes
PO
1
PO
2
PO
3
PO
4
PO
5
PO
6
PO
7
PO
8
PO
9
PO
10
PO
11
PO
12
PO
13
LO15545344454344
LO25444545454444
LO34454444454443
* 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