Computer Programming (Evening Education) Preview
Associate	TR-NQF-HE: Level 5	QF-EHEA: Short Cycle	EQF-LLL: Level 5

Course Introduction and Application Information

Course Code:

MYO044

Course Name:

Discrete Mathematics

Semester:

Fall

Course Credits:

ECTS

Language of instruction:

Course Condition:

Does the Course Require Work Experience?:

Type of course:

Departmental Elective

Course Level:

Associate

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

QF-EHEA:Short Cycle

EQF-LLL:5. Master`s Degree

Mode of Delivery:

Face to face

Course Coordinator:

Öğr. Gör. SENA KAÇAR

Course Lecturer(s):

Öğr. Gör. Sena Kaçar

Course Assistants:

Course Objective and Content

Course Objectives:

To teach the basic mathematical structures and methods required in the study areas for computer programming.
To develop mathematical modeling and abstract thinking skills.
To introduce the importance and applications of formal systems.
To evaluate critically the knowledge and skills acquired in the field of discrete mathematics.
To teach programming applications of basic mathematical knowledge and theorems.
To be able to establish mathematical models of computer programming, and to simulate computer programming.

Course Content:

Computer Working Principles, Algorithm structures, Logic, Counting, Set, Relationships, Trees

Learning Outcomes

The students who have succeeded in this course;
1) To teach the basic mathematical structures and methods required in the study areas for computer programming.
2) To develop mathematical modeling and abstract thinking skills
3) To introduce the importance and applications of formal systems
4) To evaluate critically the knowledge and skills acquired in the field of discrete mathematics.
5) To teach programming applications of basic mathematical knowledge and theorems.
6) To be able to establish mathematical models of computer programming, and to simulate computer programming.

Course Flow Plan

Week	Subject	Related Preparation
1)	The Foundations: Logic and Proofs	None
2)	Basic Structures: Sets, Functions, Sequences, Sums, and Matrices	None
3)	Algorithms	None
4)	Number Theory and Cryptography	None
5)	Induction and Recursion	None
6)	Counting	None
7)	Discrete Probability	None
8)	Midterm	1-7. Weeks
9)	Advanced Counting Techniques	None
10)	Relations	None
11)	Graphs	None
12)	Trees	None
13)	Boolean Algebra	None
14)	Modeling Computation	None
15)	Final	1-14. Weeks

Sources

Course Notes / Textbooks:	Discrete Mathematics and Its Applications, Kenneth H. Rosen, 7. Baskı
References:	Discrete Mathematics and Its Applications, Kenneth H. Rosen, 7. Baskı

Course - Program Learning Outcome Relationship

Course Learning Outcomes	1	2	3	4	5	6
Program Outcomes
1) He gains the ability of problem solving and analytical thinking skills.
2) He learns the fundamentals of computer programming, hardware and software and the basic computer concepts.
3) He develops algorithms according to the problems, gains the ability to distinguish the appropriate ones from the fundamental algorithms for the problem.
4) He understands object-oriented programming concept and web programming.
5) He learns radix systems, fundamental electronics and computer hardware knowledge.
6) He gains mobile programming skills and develops applications for mobile platforms.
7) He designs and codes databases.
8) He learns to program and use computer networks, open source operating systems.
9) He uses the English language effectively.
10) He learns to use appropriate data structures according to programming requirements.
11) He develops software individually or as a team.
12) He follows developments in the field, high technology tools / applications.
13) He gains awareness of professional and ethical responsibility and has an awareness of professional ethics.

Course - Learning Outcome Relationship

No Effect	1 Lowest	2 Average	3 Highest

	Program Outcomes	Level of Contribution
1)	He gains the ability of problem solving and analytical thinking skills.	2
2)	He learns the fundamentals of computer programming, hardware and software and the basic computer concepts.	2
3)	He develops algorithms according to the problems, gains the ability to distinguish the appropriate ones from the fundamental algorithms for the problem.	2
4)	He understands object-oriented programming concept and web programming.	2
5)	He learns radix systems, fundamental electronics and computer hardware knowledge.	2
6)	He gains mobile programming skills and develops applications for mobile platforms.	2
7)	He designs and codes databases.	2
8)	He learns to program and use computer networks, open source operating systems.	2
9)	He uses the English language effectively.	2
10)	He learns to use appropriate data structures according to programming requirements.	2
11)	He develops software individually or as a team.	2
12)	He follows developments in the field, high technology tools / applications.	2
13)	He gains awareness of professional and ethical responsibility and has an awareness of professional ethics.	2

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	2	10	1		22
Midterms	1	25	1		26
Final	1	30	1		31
Total Workload					79