Course Information

Course Title	Code	Semester	L+U Hour	Credits	ECTS
ALGORITHM AND PROGRAMMING	ABY114	2. Semester	0 + 0	0	5.0

Prerequisites

None

Language of Instruction	Turkish
Course Level	Associate's Degree
Course Type	Compulsory
Mode of delivery
Course Coordinator
Instructors
Assistants
Goals	The main aim of this course is to show a problem solution which is given and coding process of any programming tool.
Course Content	Week 1 Introduction to Programming and Problem Solving: Problem Solving Concepts and Strategies Week 2 Problem Solving Process and Tools. Week 3 Logic Structures: Introduction to Programming Structure Week 4 Problem Solving Approaches, Sequential Logic Structure, Decision Structures Week 5 Loops, Case Logic Structure Week 6 Sort Algorithms Week 7 Search Algorithms Week 8 Algorithmic Puuzles Week 9 Problem Solving Approaches: Problem Solving with Arrays Week 10 Problem Solving with Pointers and Dynamic Memory Week 11 Problem Solving with Classes Week 12 Problem Solving with Recursion Week 13 Problem Solving with Code Reuse Week 14 Thinking like a programmer.
Learning Outcomes	1) At the end of this course, Students will learn about problem solving concepts and strategies 2) Students will have acquired the ability to understand and critique of problem solving process 3) Students will use problem solving tools

Week	Topics	Teaching and Learning Methods and Techniques	Study Materials
1. Week	Introduction to Programming and Problem Solving: Problem Solving Concepts and Strategies
2. Week	Problem Solving Process and Tools.
3. Week	Logic Structures: Introduction to Programming Structure
4. Week	Problem Solving Approaches, Sequential Logic Structure, Decision Structures
5. Week	Loops, Case Logic Structure
6. Week	Sort Algorithms
7. Week	Search Algorithms
8. Week	Algorithmic Puzzles
9. Week	Problem Solving Approaches: Problem Solving with Arrays
10. Week	Problem Solving with Pointers and Dynamic Memory
11. Week	Problem Solving with Classes
12. Week	Problem Solving with Recursion
13. Week	Problem Solving with Code Reuse
14. Week	Thinking like a programmer

Recommended Sources

Cormen, T. H., Charles, E. L., Ronald, L. R., & Clifford, S. (2009). Introduction to Algorithms (3rd edition). Cambridge, MA: MIT Press.

Cormen, T. H., Leiserson, C. E., Rivest, R. L. & Stein, C. (2009).Introduction to Algorithms. Massacusette Institute of Technology:USA.

Çölkesen, R. (2002). Veri yapıları ve algoritmalar. Papatya Yayınları.

Levitin, A. (2011). Algorithmic Puzzles. Oxford University Press.

Skiena, S. S. (2009).The Algorithm Design Manual. Springer London.

Soner Çelikkol (2001). Programlamaya giriş ve algoritmalar. Akademi Yayınları.

Spraul, A. (2012). Think Like a Programmer: An Introduction to Creative Problem Solving. No Starch Press: San Fransisco.

Vatansever, F. (2009). Algoritma geliştirme ve programlamaya giriş. Seçkin Yayınları.

Wang, W. (2008). Beginning Programming All-In-One Desk Reference For Dummies (First Edition). For Dummies.

*DK = Course's Contrubution.

	0	1	2	3	4	5
Level of contribution	None	Very Low	Low	Fair	High	Very High

Event	Quantity	Duration (Hour)	Total Workload (Hour)
Course Duration (Total weeks*Hours per week)	14	3	42
Work Hour outside Classroom (Preparation, strengthening)	14	1	14
Homework	14	1	14
Activity (Web Search, Library Work, Trip, Observation, Interview etc.)	14	1	14
Practice (Teaching Practice, Music/Musical Instrument Practice , Statistics, Laboratory, Field Work, Clinic and Polyclinic Practice)	14	4	56
Midterm Exam	1	1	1
Final Exam	1	1	1
Total Workload
Total Workload / 30 (s)
ECTS Credit of the Course			30