Algorithm and Programming
Elementary Mathematics Education
Faculty of Education
First Cycle (Bachelor's Degree)
| Course Unit Title | Course Unit Code | Type of Course Unit | Level of Course Unit | Year of Study | Semester | ECTS Credits |
|---|---|---|---|---|---|---|
| Algorithm and Programming | IMO405 | Compulsory | Bachelor's degree | 4 | Fall | 4 |
Name of Lecturer(s)
Associate Prof. Dr. Funda DAĞ
Learning Outcomes of the Course Unit
1) Explains algorithm design and input-output concepts.
2) Design algorithms with various visualization programs (Scratch, Small Basic etc.).
3) Develops appropriate solution algorithms using the function.
4) Develops appropriate solution algorithms using array data structures.
5) Apply algorithm design in computer algebra systems.
6) Explains basic algorithm concepts (condition, branching, loop).
Program Competencies-Learning Outcomes Relation
| Program Competencies | ||||||||||||||
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | ||
| Learning Outcomes | ||||||||||||||
| 1 | No relation | Middle | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | |
| 2 | No relation | No relation | No relation | No relation | No relation | No relation | Middle | No relation | No relation | No relation | No relation | No relation | No relation | |
| 3 | No relation | No relation | No relation | No relation | No relation | No relation | Middle | No relation | No relation | No relation | No relation | No relation | No relation | |
| 4 | No relation | No relation | No relation | No relation | No relation | No relation | No relation | Middle | No relation | No relation | No relation | No relation | No relation | |
| 5 | No relation | No relation | No relation | No relation | No relation | No relation | Middle | No relation | No relation | No relation | No relation | No relation | No relation | |
| 6 | No relation | No relation | No relation | No relation | No relation | No relation | Middle | No relation | No relation | No relation | No relation | No relation | No relation | |
Mode of Delivery
Face to Face
Prerequisites and Co-Requisites
None
Recommended Optional Programme Components
Bilişim Teknolojileri
Course Contents
Algorithm design; flow diagrams, input-output concepts, cycles, decision making, decision making and development of algorithms suitable for cyclic problems; visualization of algorithm and flow charts the applications of the programs used (scratch, code.org); function establishment of appropriate dissolution algorithms; using single and double-size arrays development; coding algorithms in Computer Algebra Systems and applications.
Recommended or Required Reading
Planned Learning Activities and Teaching Methods
Assessment Methods and Criteria
Language of Instruction
Turkish
Work Placement(s)
Not Required