• HOME
• ABOUT US
  • Name Address
  • General Description
  • Governance
  • Academic Calendar
  • Degree Programmes
  • List of Programmes in English
  • General Admission and Registration Procedures
  • Credit Mobility and Recognition of Prior Learning
  • ECTS Credit Allocation
  • Academic Guidance
  • Contacts
• Degree Programmes
  • Third Cycle Programmes (Doctorate Degree)
  • Second Cycle Programmes (Master's Degree)
  • First Cycle Programmes (Bachelor's Degree)
  • Short Cycle Programmes (Associate's Degree)
• GENERAL INFORMATION FOR STUDENTS
  • Cost of Living
  • Accommodation
  • Meals
  • Medical Facilities
  • Facilities for Disabled Students
  • Insurance
  • Financial Supports
  • Student Affairs Office
  • Practical Information for International Students
  • Language Courses
  • Work Placement Possibilities
  • Sports, Social and Cultural Facilities
  • Student Associations and Clubs
  • About İzmir - Turkey
• INTERNATIONAL RELATIONS
  • International Relations Office
  • Registration Procedures
  • Agreements
  • Coordinators
  • Documents
  • List of Programmes in English
  • ECTS / DS Labels

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS LMÖ 2008 ALGORıTHM AND PROGRAMMING COMPULSORY 3 0 0 4

Offered By

Mathematics Teacher Education

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSOCIATE PROFESSOR AYTEN ERDURAN

Offered to

Mathematics Teacher Education

Course Objective

To be able to understand the basis and operation of the algorithm, to be able to write the process steps in solving a problem, to be able to convert these process steps into a flow chart and to use it for educational software.

Learning Outcomes of the Course Unit

1   Draw flow charts in algorithms. 2   Write loop programs. 3   Use subprograms and functions. 4   Make applications related to arrays. 5   Manage files and use them in programs with file operations. 6   Code and implement algorithms in Computer Algebra Systems. 7   Create appropriate solution algorithms using functions.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Algorithm design 2 Flow charts 3 Input-output concepts 4 Cycles 5 Decision structures 6 Development of algorithms suitable for decision making and cyclical problems 7 Applications of programs where algorithms and flow charts are visualized (such as scratch, code.org) 8 General review, course evaluation, midterm exam 9 Creating appropriate solution algorithms using functions 10 Developing appropriate solution algorithms using one and two dimensional arrays 11 Coding and applications of the created algorithms in Computer Algebra Systems 12 Coding and applications of the created algorithms in Computer Algebra Systems 13 Coding and applications of the created algorithms in Computer Algebra Systems 14 Coding and applications of the created algorithms in Computer Algebra Systems 15 Final exam

Recomended or Required Reading

Çamoğlu, K. (2011). Algoritma Yardımcı kaynaklar: Çelikkol, S. (2007). Programlamaya Giriş ve Algoritmalar Referanslar: Yaşar, E (2009). Algoritma ve Programlamaya Giriş Other course materials: Internet, lecture notes

Planned Learning Activities and Teaching Methods

Lecture, discussion, question and answer

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA 1 MTE Midterm Exam 2 DTK Other Activity 3 FN Semester final exam 4 BNS BNS Student examVZ * 0.30 + Student examDTK * 0.10 + FN * 0.60 5 BUT Make- up note 6 BBN End of make-up grade Student examVZ * 0.30 +Student examDTK * 0.10 + BUT * 0.60

Further Notes About Assessment Methods

None

Assessment Criteria

Assessment of students is measured by midterm, assignment and final exams in line with the learning outcomes.

Language of Instruction

Turkish

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

ayten.erduran@deu.edu.tr

Office Hours

Friday: 9.00-10.00

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours) Lectures 13 3 39 Preparations before/after weekly lectures 13 1 13 Preparation for midterm exam 1 10 10 Preparation for final exam 1 15 15 Preparing presentations 1 20 20 Midterm 1 2 2 Final 1 2 2 TOTAL WORKLOAD (hours) 101

Contribution of Learning Outcomes to Programme Outcomes

PO/LO PO.1 PO.2 PO.3 PO.4 PO.5 PO.6 PO.7 PO.8 PO.9 PO.10 PO.11 PO.12 PO.13 PO.14 PO.15 PO.16 PO.17 PO.18 LO.1 3 3 5 LO.2 3 3 5 LO.3 3 3 5 LO.4 3 3 5 LO.5 3 3 5 LO.6 3 3 5 LO.7 3 3 5