Course Information

Course Name	Turkish	Bilgi İşlem Algoritmaları
	English	Data Processing Algorithms
Course Code	MAT 333	Credit	Lecture (hour/week)	Recitation (hour/week)	Laboratory (hour/week)
Semester	5	3	3	-	-
Course Language		Turkish
Course Coordinator		Evren Tanrıöver
Course Objectives		To teach algorithm design techniques. To teach to determine the most appropriate data structure for an algorithm. To teach the ability to determine the complexity of the runtime of an algorithm for best, average and worst cases. To teach to write pseudocode for an algorithm and to analyze through this code.
Course Description		Mathematics of Algorithms, Order of Magnitude, Problem Solving with Algorithms and Data Structures, Analysis of Algorithms, Graph Algorithms, Greedy Algorithms, Divide and Conquer, Dynamic Programming, Network Flow, P vs NP Problem
Course Outcomes		Students completing this course will be able to: Adapt and analyze many computing algorithms, Choose the most suitable data structure for an algorithm, Model daily life problems and find the most suitable algorithm. Understand complexity classes such as P and NP.
Pre-requisite(s)		MAT226-E / MUH212-E min DD
Required Facilities		*
Other		*
Textbook		J. Kleinberg & E. Tardos, Algorithm Design, Addison Wesley, 2006.
Other References		G.Brassard & P. Bratley, Fundamentals of Algorithmics Prentice Hall, 1996. R.Sedgewick, Algorithms in C, Addison Wesley, 1990.