COURSE UNIT TITLE

: ALGORITHM AND PROGRAMMING

DEGREE PROGRAMMES

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

The aim of this course is 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, Discussion, Question-Answer.

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

Midterm and final exams are determined according to the weekly course content within the scope of the learning outcomes of the course.

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
Cahit Arf Building
12442

Office Hours

Tuesday 13:00-14:00

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/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10PO.11PO.12PO.13PO.14PO.15
LO.1443534533
LO.24535445
LO.3453555555
LO.4453535
LO.5453535
LO.6453535
LO.7453535

CONTACT INFORMATION
Dokuz Eylül Üniversitesi Cumhuriyet Bulvarı No: 144 35210 Alsancak / İZMİR
Phone: +90(232) 412 12 12 - Fax: +90 (232) 464 81 35

Copyright 2015 DEÜ. BİD

HOME / ABOUT US / DEGREE PROGRAMMES / GENERAL INFORMATION FOR STUDENTS / INTERNATIONAL RELATIONS