TYPE OF COURSE UNIT	Elective Course
LEVEL OF COURSE UNIT	Doctorate Of Science
YEAR OF STUDY	-
SEMESTER	-
NUMBER OF ECTS CREDITS ALLOCATED	10
NAME OF LECTURER(S)	-
LEARNING OUTCOMES OF THE COURSE UNIT	At the end of this course, the students; 1) To be able to comprehend algorithms. 2) To be able to comprehend counting method. 3) To be able to perceive the fields of application of paths and cycles.
MODE OF DELIVERY	Face to face
PRE-REQUISITES OF THE COURSE	No
RECOMMENDED OPTIONAL PROGRAMME COMPONENT	None
COURSE DEFINITION	Algorithms; the Euclidean algorithm, recursive algorithms, counting methods; basic principles, permutations and combinations, the pigeonhole principle; recurrence relations; graph theory; paths and cycles, Hamiltonian cycles, a shortest-path algorithm, isomorphism of graphs; trees.
COURSE CONTENTS	WEEK TOPICS 1st Week Algorithms 2nd Week Euclidean algorithm 3rd Week recursive algorithms 4th Week counting methods 5th Week basic principles 6th Week permutations and combinations 7th Week the pigeonhole principle 8th Week recurrence relations 9th Week graph theory 10th Week paths and cycles 11th Week Hamiltonian cycles 12th Week a shortest-path algorithm 13th Week isomorphism of graphs; trees 14th Week General Review
RECOMENDED OR REQUIRED READING	Discrete Mathematics, R.J.BAUGH Prentice Hall,1993
PLANNED LEARNING ACTIVITIES AND TEACHING METHODS	Lecture,Practice,Other
ASSESSMENT METHODS AND CRITERIA	Quantity Percentage(%) Mid-term 1 40 Total(%) 40 Contribution of In-term Studies to Overall Grade(%) 40 Contribution of Final Examination to Overall Grade(%) 60 Total(%) 100
ECTS WORKLOAD	Activities Number Hours Workload Midterm exam Preparation for Quiz Individual or group work 14 12 168 Preparation for Final exam 1 60 60 Course hours 14 3 42 Preparation for Midterm exam Laboratory (including preparation) Final exam 1 1,5 1,5 Homework 1 20 20 Total Workload 291,5 Total Workload / 30 9,71 ECTS Credits of the Course 10
LANGUAGE OF INSTRUCTION	Turkish
WORK PLACEMENT(S)	No