DISCRETE MATHEMATICS PROGRAMME COURSE DESCRIPTION

Code	Name of the Course Unit	Semester	In-Class Hours (T+P)	Credit	ECTS Credit
MTH218	DISCRETE MATHEMATICS	4	3	3	5

GENERAL INFORMATION
Language of Instruction :	English
Level of the Course Unit :	BACHELOR'S DEGREE, TYY: + 6.Level, EQF-LLL: 6.Level, QF-EHEA: First Cycle
Type of the Course :	Compulsory
Mode of Delivery of the Course Unit	-
Coordinator of the Course Unit	Assist.Prof. OĞUZHAN ÖZTAŞ
Instructor(s) of the Course Unit	Assist.Prof. TARIK ARABACI
Course Prerequisite	No

OBJECTIVES AND CONTENTS
Objectives of the Course Unit:	The course aims to develop students’ algorithmic thinking skills by covering the fundamentals of mathematics—which forms the mathematical foundation of computer software—and key topics in mathematical logic. Additionally, it provides an introduction to information security by introducing concepts related to cryptology.
Contents of the Course Unit:	Basic Concepts (Logic and Sets, Functions and Binary Operation Structures), Cryptology, Graph Theory, Recursive Relations

KEY LEARNING OUTCOMES OF THE COURSE UNIT (On successful completion of this course unit, students/learners will or will be able to)
Ability to use abstract thinking skills.
Ability to use mathematical knowledge in other fields.
Ability to follow professional and current developments, and to continuously improve knowledge and skills in order to adapt to a rapidly changing technological environment.
Having useful knowledge about the scope, applications, history, problems, and methods of mathematics as both a scientific and intellectual discipline for humanity.
Ability to use mathematics as an effective tool for communication, problem solving, and brainstorming, and to use technology as an effective tool for understanding and applying mathematics.

WEEKLY COURSE CONTENTS AND STUDY MATERIALS FOR PRELIMINARY & FURTHER STUDY
Week	Preparatory	Topics(Subjects)	Method
1	-	Logic, Propositions	Lecture, Question & Answer, Problem Solving
2	-	Proof Techniques	Lecture, Question & Answer, Problem Solving
3	-	Proof Techniques	Lecture, Question & Answer, Problem Solving
4	-	Sets	Lecture, Question & Answer, Problem Solving
5	-	Relations and Their Properties	Lecture, Question & Answer, Problem Solving
6	-	Equivalence Relations	Lecture, Question & Answer, Problem Solving
7	-	Order Relations	Lecture, Question & Answer, Problem Solving
8	-	Functions	Lecture, Question & Answer, Problem Solving
9	-	Binary Operations and Their Properties	Lecture, Question & Answer, Problem Solving
10	-	MID-TERM EXAM	-
11	-	Algebraic Structures	Lecture, Question & Answer, Problem Solving
12	-	Cryptology	Lecture, Question & Answer, Problem Solving
13	-	Cryptology	Lecture, Question & Answer, Problem Solving
14	-	Recurrence Relations	Lecture, Question & Answer, Problem Solving
15	-	Graph Theory	Lecture, Question & Answer, Problem Solving
16	-	FINAL EXAM	-
17	-	FINAL EXAM	-

SOURCE MATERIALS & RECOMMENDED READING
Kenneth Rosen, Discrete Mathematics and Its Applications, Mc Graw Hill, 1999.
Ralph Grimaldi, Discrete and Combinatorial Mathematics, Pearson, Addison-Wesley, 6th Edition, 2004.

ASSESSMENT
Assessment & Grading of In-Term Activities	Number of Activities	Degree of Contribution (%)	Description	Examination Method
Mid-Term Exam	1	40		Classical Exam
Short Exam	1	10
Final Exam	1	50		Classical Exam
TOTAL	3	100

Level of Contribution
0	1	2	3	4	5

KNOWLEDGE
Theoretical
	Programme Learning Outcomes	Level of Contribution
		0	1	2	3	4	5
1	Explains the fundamental engineering concepts of computer science and relates them to the groundwork of computer science.	0

KNOWLEDGE
Factual
	Programme Learning Outcomes	Level of Contribution
		0	1	2	3	4	5
1	Uses theoretical and practical knowledge coming from mathematics, probability, statistics and various other branches of life sciences, to find solutions to engineering problems.						5

SKILLS
Cognitive
	Programme Learning Outcomes	Level of Contribution
		0	1	2	3	4	5
1	Determines the components and the underlying process of a system and designs an appropriate computational model under reasonable constraints.		1
2	Designs a computer-aided conceptual model with modern techniques.		1

SKILLS
Practical
	Programme Learning Outcomes	Level of Contribution
		0	1	2	3	4	5
1	Determines, detects and analyzes the areas of computer science applications and develops appropriate solutions.	0
2	Identifies, models and solves computer engineering problems by applying appropriate analytical methods.	0
3	Determines and uses the necessary information technologies in an efficient way for engineering applications.			2

OCCUPATIONAL
Autonomy & Responsibility
	Programme Learning Outcomes	Level of Contribution
		0	1	2	3	4	5
1	Possess the responsibility and ability to design and conduct experiments for engineering problems by collecting, analyzing and interpreting data.		1
2	Possess the ability to conduct effective individual study.			2
3	Takes responsibility as a team work and contributes in an effective way.	0

WORKLOAD & ECTS CREDITS OF THE COURSE UNIT
Workload for Learning & Teaching Activities
Type of the Learning Activites	Learning Activities (# of week)	Duration (hours, h)	Workload (h)
Lecture & In-Class Activities	14	3	42
Preliminary & Further Study	14	3	42
Land Surveying	0	0	0
Group Work	0	0	0
Laboratory	0	0	0
Reading	0	0	0
Assignment (Homework)	0	0	0
Project Work	0	0	0
Seminar	0	0	0
Internship	0	0	0
Technical Visit	0	0	0
Web Based Learning	0	0	0
Implementation/Application/Practice	0	0	0
Practice at a workplace	0	0	0
Occupational Activity	0	0	0
Social Activity	0	0	0
Thesis Work	0	0	0
Field Study	0	0	0
Report Writing	0	0	0
Final Exam	1	2	2
Preparation for the Final Exam	5	4	20
Mid-Term Exam	1	2	2
Preparation for the Mid-Term Exam	5	4	20
Short Exam	1	1	1
Preparation for the Short Exam	2	2	4
TOTAL	43	0	133