Course Introduction and Application Information

Course Code:

MATH111

Course Name:

Discrete Mathematics

Semester:

Fall

Course Credits:

ECTS

Language of instruction:

English

Course Condition:

Does the Course Require Work Experience?:

Type of course:

Compulsory Courses

Course Level:

Bachelor

TR-NQF-HE:6. Master`s Degree

QF-EHEA:First Cycle

EQF-LLL:6. Master`s Degree

Mode of Delivery:

Face to face

Course Coordinator:

Prof. Dr. SELÇUK DEMİR

Course Lecturer(s):

Assist. Prof. Dr. FUNDA ÖZDEMIR

Course Assistants:

Course Objective and Content

Course Objectives:	To introduce discrete mathematical structures suh as formal mathematical reasoning techniques, algorithm formulation, computation of time complexity, basic counting techniques, relations, graphs and trees. The course aims to acquire the necessary mathematical background for areas that require computation such as computer science and to apply the acquired skills to practical problems.
Course Content:	Logic, proof methods, sets, functions, sequences, sums, algorithms, growth of functions, complexity of algorithms, elementary number theory, cryptography, counting, solving recurrence relations, relations, graphs and trees.

Learning Outcomes

The students who have succeeded in this course;
1) Gains the ability to express mathematical arguments and natural language sentences through the language of symbolic logic; decides whether a given argument is valid or not using logic and inference rules and makes simple mathematical proofs.
2) Describes computer programs in a formal mathematical manner by means of pseudocodes and analyzes algorithms in terms of time complexity.
3) Comprehends basic number theory concepts such as modular arithmetic, integer representations and primality, and their basic applications in cryptography.
4) Understands and applies counting principles.
5) Solves recurrence relations.
6) Knows the basic properties of relations, graphs and trees.

Course Flow Plan

Week	Subject	Related Preparation
1)	Propositional logic and applications; propositional function and quantifiers
2)	Inference rules, proof methods
3)	Sets, functions, sums and sequences
4)	Algorithms
5)	Growth of functions, complexity of algorithms
6)	Divisibility, modular arithmetic, integer representations
7)	Primes, greatest common divisor, solving congruences
8)	Midterm Exam
9)	Cryptography
10)	Mathematical induction, strong induction and well-ordering
11)	Counting
12)	Solving recurrence relations
13)	Relations
14)	Graphs and trees

Sources

Course Notes / Textbooks:	Discrete Mathematics and Its Applications, Kenneth H. Rosen, McGraw-Hill Education
References:	Discrete Mathematics, Richard Johnsonbaugh, Pearson

Course - Program Learning Outcome Relationship

Course Learning Outcomes	1	2	3	4	5	6
Program Outcomes

Course - Learning Outcome Relationship

No Effect	1 Lowest	2 Average	3 Highest

Program Outcomes

Level of Contribution

Assessment & Grading

Semester Requirements	Number of Activities	Level of Contribution
Midterms	1	% 40
Final	1	% 60
total		% 100
PERCENTAGE OF SEMESTER WORK		% 40
PERCENTAGE OF FINAL WORK		% 60
total		% 100

Workload and ECTS Credit Calculation

Activities	Number of Activities	Preparation for the Activity	Spent for the Activity Itself	Completing the Activity Requirements	Workload
Course Hours	13	0	3		39
Study Hours Out of Class	13	0	5		65
Midterms	1	13	2		15
Final	1	23	2		25
Total Workload					144