Your transaction is in progress.
Please Wait...
Course Details
KTO KARATAY UNIVERSITY
Mühendislik ve Doğa Bilimleri Fakültesi
Programme of Computer Engineering
Course Details
Course Code Course Name Year Period Semester T+A+L Credit ECTS
05020004 Discrete Computational Structures 1 Spring 2 3+0+0 3 5
Course Type Compulsory
Course Cycle Bachelor's (First Cycle) (TQF-HE: Level 6 / QF-EHEA: Level 1 / EQF-LLL: Level 6)
Course Language Turkish
Methods and Techniques -
Mode of Delivery Face to Face
Prerequisites -
Coordinator -
Instructor(s) Asst. Prof. Ali Osman ÇIBIKDİKEN
Instructor Assistant(s) -
Course Instructor(s)
Name and Surname Room E-Mail Address Internal Meeting Hours
Asst. Prof. Ali Osman ÇIBIKDİKEN A-124 [email protected] 7585 Monday
14:00-15:00
Course Content
Teklif mantığı ve kanıtları. Teoriyi ayarla. İlişkiler ve işlevler. Cebirsel yapılar Gruplar ve yarı gruplar. Kafes yapıları ve Boole cebri. Grafik teorisi. Algoritmalar ve turing makineleri.
Objectives of the Course
This course aims at preparing the student to future courses for which mathemat- ical reasoning and algorithm development will be essential.
Contribution of the Course to Field Teaching
Basic Vocational Courses X
Specialization / Field Courses
Support Courses
Transferable Skills Courses
Humanities, Communication and Management Skills Courses
Relationships between Course Learning Outcomes and Program Outcomes
Relationship Levels
Lowest Low Medium High Highest
1 2 3 4 5
# Program Learning Outcomes Level
P1 Adequate knowledge in mathematics, science and related engineering discipline accumulation; theoretical and practical knowledge in these areas, complex engineering the ability to use in problems. 5
P2 Ability to identify, formulate, and solve complex engineering problems; ability to select and apply appropriate analysis and modeling methods for this purpose 5
Course Learning Outcomes
Upon the successful completion of this course, students will be able to:
No Learning Outcomes Outcome Relationship Measurement Method **
O1 Mathematical models of engineering problems are created and simulated P.1.6 1
O2 Determining the skill required for problem solving and developing the necessary method. P.2.4 1
** Written Exam: 1, Oral Exam: 2, Homework: 3, Lab./Exam: 4, Seminar/Presentation: 5, Term Paper: 6, Application: 7
Weekly Detailed Course Contents
Week Topics
1 Introductin
2 Propositional logic and proofs
3 Propositional logic and proofs
4 Set theory
5 Set theory
6 Relations and functions
7 Relations and functions
8 Algebraic structures
9 Algebraic structures
10 Groups and semi-groups
11 Lattice structures and Boolean algebra
12 Lattice structures and Boolean algebra
13 Graph theory
14 Algorithms and turing machines
Textbook or Material
Resources Discrete Mathematics and Its Applications, by K. H. Rosen 4th (or later) Edition, McGraw-Hill, (1999)
Evaluation Method and Passing Criteria
In-Term Studies Quantity Percentage
Attendance - -
Laboratory - -
Practice - -
Course Specific Internship (If Any) - -
Homework - -
Presentation - -
Projects - -
Quiz - -
Midterms 1 40 (%)
Final Exam 1 60 (%)
Total 100 (%)
ECTS / Working Load Table
Quantity Duration Total Work Load
Course Week Number and Time 14 3 42
Out-of-Class Study Time (Pre-study, Library, Reinforcement) 14 3 42
Midterms 1 33 33
Quiz 0 0 0
Homework 0 0 0
Practice 0 0 0
Laboratory 0 0 0
Project 0 0 0
Workshop 0 0 0
Presentation/Seminar Preparation 0 0 0
Fieldwork 0 0 0
Final Exam 1 33 33
Other 0 0 0
Total Work Load: 150
Total Work Load / 30 5
Course ECTS Credits: 5
Course - Learning Outcomes Matrix
Relationship Levels
Lowest Low Medium High Highest
1 2 3 4 5
# Learning Outcomes P1 P2
O1 Mathematical models of engineering problems are created and simulated 2 4
O2 Determining the skill required for problem solving and developing the necessary method. 5 4