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

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   To be able to draw the flow charts in the algorithm 2   To be able to write loop programs 3   To be able to use subprograms and functions 4   To be able to do applications about series 5   To be able to files with file operations and be able to use them in programs 6   To be able to do coding and applications of Algorithms in Computer Algebra Systems 7   To be able to 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 Course Overview, Evaluation and Midterm Examination 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 Algoratimalar Uğurkaya, C. (2004). Programlama Sanatı Yaşar, E (2009). Algoritma ve Programlamaya Giriş

Planned Learning Activities and Teaching Methods

Direct instruction, question-answer method

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA 1 VZ Midterm 2 FN Semester final exam 3 BNS BNS Student examVZ * 0.40 + Student examFN * 0.60 4 BUT Make-up note 5 BBN End of make-up grade Student examVZ * 0.40 + Student examBUT * 0.60 *** Resit Exam is Not Administered in Institutions Where Resit is not Applicable.

Further Notes About Assessment Methods

None

Assessment Criteria

Midterm exam and final exam

Language of Instruction

Turkish

Course Policies and Rules

Seventy percent of the course is obligatory to attend.

Contact Details for the Lecturer(s)

serkan.narli@deu.edu.tr

Office Hours

To be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours) Lectures 13 2 26 Preparations before/after weekly lectures 8 2 16 Preparation for midterm exam 1 7 7 Preparation for final exam 1 10 10 Final 1 1 1 Midterm 1 1 1 TOTAL WORKLOAD (hours) 61

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