• 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 IMÖ 2006 ALGORITHM AND PROGRAMMING COMPULSORY 2 2 0 4

Offered By

ELEMENTARY MATHEMATICS TEACHER EDUCATION

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

PROFESSOR DOCTOR SERKAN NARLI

Offered to

ELEMENTARY MATHEMATICS TEACHER EDUCATION

Course Objective

To be able to understand the fundamentals and operations of the algorithm, to write the process steps in the solution of a problem, to be able to convert these procedural steps into a flowchart and to use it for educational software.

Learning Outcomes of the Course Unit

1   Draw the flow charts in the algorithm 2   Write loop programs 3   Use subprograms and functions 4   Do applications about series 5   Files with file operations and be able to use them in programs 6   Coding and applications of Algorithms in Computer Algebra Systems 7   Create appropriate solution algorithms using function

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Problem solving, algorithms and flow charts 2 Flow diagrams, input-output concepts, cycles, decision structures 3 Structure and definition of Basic programming language 4 Applications of programs (such as scratch, code.org) where algorithms and flow charts are visualized and used 5 Series 6 String expressions 7 Predefined functions 8 Midterm 9 Sub-programs 10 File operations 11 Read from file 12 Applications 13 Development of appropriate solution algorithms using single and double dimensional arrays 14 Coding and applications of generated algorithms in Computer Algebra Systems 15 Final Exam

Recomended or Required Reading

Çamoğlu, K. (2011). Algoritma Çelikkol, S. (2007). Programlamaya Giriş ve Algoritmalar Yaşar, E (2009). Algoritma ve Programlamaya Giriş

Planned Learning Activities and Teaching Methods

Lecture, discussion, question-answer, problem solving, active learning techniques, group work.

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 exams, assignments 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)

serkan.narli@deu.edu.tr

Office Hours

Will be announced at the beginning of the semester.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours) Lectures 13 2 26 Tutorials 13 2 26 Preparations before/after weekly lectures 13 1 13 Preparation for midterm exam 1 10 10 Preparation for final exam 1 10 10 Preparing assignments 2 10 20 Midterm 1 1 1 Final 1 1 1 TOTAL WORKLOAD (hours) 107

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 LO.1 4 4 3 5 3 4 5 3 3 LO.2 4 5 3 5 4 4 5 LO.3 4 5 3 5 5 5 5 5 5 LO.4 4 5 3 5 3 5 LO.5 4 5 3 5 3 5 LO.6 4 5 3 5 3 5 LO.7 4 5 3 5 3 5