Course Information

Course Information
Course Title Code Language Type Semester L+U Hour Credits ECTS
Algorithm and Programming MAE204 Turkish Compulsory 4. Semester 2 + 0 2.0 3.0
Prerequisite Courses
Course Level Undergraduate
Mode of delivery Face to face
Course Coordinator Prof. Dr. ŞAHİN DANİŞMAN
Instructor(s)
Goals Gaining general algorithm and programming knowledge and making various applications with developed algorithms
Course Content Algorithm design; flow diagrams, input-output concepts, cycles, decision structures, decision making and developing appropriate algorithms to cyclical problems; applications of programs (such as scratch, code.org) where algorithms and flow charts are visualized and used; creating of appropriate solution algorithms using function; development of appropriate solution algorithms using single and double dimensional series; coding and applications in computer algebra systems.
Learning Outcomes
# Öğrenme Kazanımı
1 Students will design algorithms and develop appropriate algorithms for cyclic problems
2 Students will visualize algorithms and flowcharts and apply programs such as scratch, code.org.
3 Students will create appropriate solution algorithms using the function.
4 Students will develop appropriate solution algorithms using single and double dimensional arrays.
5 Students will make the coding and applications of algorithms in computer algebra systems.
Lesson Plan (Weekly Topics)
Week Topics/Applications Method
1. Week Algorithm design Presentation (Preparation) Class Hours Interview
2. Week The place of the algorithm in problem solving; flow diagrams, input-output concepts, loops, decision structures, constant and variable concepts, data types, operators, arrays, functions; Developing appropriate solution algorithms using these components Presentation (Preparation) Interview Class Hours
3. Week The place of the algorithm in problem solving; flow diagrams, input-output concepts, loops, decision structures, constant and variable concepts, data types, operators, arrays, functions; Developing appropriate solution algorithms using these components Interview Presentation (Preparation) Class Hours
4. Week The place of the algorithm in problem solving; flow diagrams, input-output concepts, loops, decision structures, constant and variable concepts, data types, operators, arrays, functions; Developing appropriate solution algorithms using these components Presentation (Preparation) Interview Class Hours
5. Week Applications of programs where algorithms and flowcharts are visualized (such as scratch, code.org, flowgorithm) Interview Presentation (Preparation) Class Hours
6. Week Applications of programs where algorithms and flowcharts are visualized (such as scratch, code.org, flowgorithm) Interview Presentation (Preparation) Class Hours
7. Week Applications of programs where algorithms and flowcharts are visualized (such as scratch, code.org, flowgorithm) Interview Presentation (Preparation) Class Hours
8. Week Midterm
9. Week Coding and applications of the created algorithms in Computer Algebra Systems Presentation (Preparation) Interview Class Hours
10. Week Coding and applications of the created algorithms in Computer Algebra Systems Presentation (Preparation) Interview Class Hours
11. Week Coding and applications of the created algorithms in Computer Algebra Systems Presentation (Preparation) Interview Class Hours
12. Week Coding and applications of the created algorithms in Computer Algebra Systems Interview Presentation (Preparation) Class Hours
13. Week Coding and applications of the created algorithms in Computer Algebra Systems Interview Presentation (Preparation) Class Hours
14. Week Final Presentation (Preparation) Interview Class Hours
*Midterm and final exam dates are not specified in the 14-week course operation plan. Midterm and final exam dates are held on the dates specified in the academic calendar with the decision of the University Senate.
The Matrix for Course & Program Learning Outcomes
No Program Requirements Level of Contribution
1 2 3 4 5
1 They know and apply contemporary teaching methods and techniques, assessment and evaluation methods.
17 Have the skills of mathematical communication, problem solving, reasoning and relating.
Relations with Education Attainment Program Course Competencies
Program Requirements DK1 DK2 DK3 DK4 DK5
PY1 5 5 5 5 5
PY17 0 4 3 0 3
Recommended Sources
Ders Kitabı veya Notu Ders Kitabı veya Ders Notu bulunmamaktadır.
Diğer Kaynaklar
  • Algoritma Geliştirme ve Programlamaya Giriş, Fahri Vatansever, Seçkin-Bilgisayar
ECTS credits and course workload
ECTS credits and course workload Quantity Duration (Hour) Total Workload (Hour)
Ders İçi
Class Hours 13 2 26
Ders Dışı
Preparation, After Class Study 10 2 20
Sınavlar
Midterm 1 1 1 1
Homework 1 2 5 10
Homework 2 1 5.5 5.5
Practice 2 5 10
Classroom Activities 2 2 4
Total Workload 76.5
*AKTS = (Total Workload) / 25,5 ECTS Credit of the Course 3.0