COURSE UNIT TITLE

: ALGHORITM DESIGN AND DEVELOPMENT

DEGREE PROGRAMMES

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
BTE 1002 ALGHORITM DESIGN AND DEVELOPMENT COMPULSORY 2 2 0 5

Offered By

Computer and Instructional Technologies Teacher Education

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSOCIATE PROFESSOR KÜRŞAT ARSLAN

Offered to

Computer and Instructional Technologies Teacher Education

Course Objective

The aim of this course is to draw problem-based flow diagrams so that students understand the concept of algorithm development. Algorithm problem solving and programming; algorithm design techniques, flow diagrams, terms used in the algorithm are among the important outputs of the course. The course content also includes the implementation of different algorithms on the same sample for the use of decision structures, loops, and functions in the algorithm.

Learning Outcomes of the Course Unit

1   Explain the importance of algorithm in programming
2   Can use different algorithm design techniques
3   Can use flow diagrams according to the problem situation
4   Can develop a probing based flow diagram
5   Recognize block and text-based programming environments

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Introducing the course and explaining the rules of the course in detail; Algorithm problem solving and programming;
2 Programming Languages (development of programming languages, concepts related to programming) and mathematical, comparison and logical operations in programming languages
3 Explanation of algorithm design techniques (line algorithm, flow diagrams, pseudo code // pseudo); basic elements of the algorithm
4 Development and working methods of line algorithm and flow diagrams
5 Sequential operations, condition / decision cases, development of sample algorithms for repetitive structures
6 Generating codes in algorithms (row algorithms, flow diagrams, pseudo-codes);
7 Making basic algorithm examples (summing two counts, triangle field, comparing two counts, finding mean, writing prime numbers)
8 Introducing the basics of the programming (constants, variables, validity fields of variables)
9 Introduction to basics of programming (type conversions, operators, condition expressions)
10 Introduction to basics (loop, loop controls, functions) of programming
11 Development of search algorithms (linear search, binary search) and sorting algorithms (bubble, selective, joint, shell)
12 Problem solving methods with algorithm

Recomended or Required Reading

Çölkesen, R. (2002). Bilgisayar programlama ve yazılım mühendisliğinde veri yapıları ve algoritmalar. Papatya Yayıncılık.
Cobanoglu, B. (2016). C C ve Java Dilleriyle Algoritma ve Programlama. Abakus Kitap.
Vatansever, F. (2009). Algoritma geliştirme ve programlamaya giriş. Seçkin Yayıncılık.

Planned Learning Activities and Teaching Methods

This basic teaching approach will be a common construct of knowledge. Collaborative learning and activity based learning approaches will also be used for the course. In this context, the teacher assumes the role of guidance and provides an active learning environment and the support that the student needs / hears during the learning period. The information provided and the weekly activities that are prepared will provide information that students can use in their own minds, both today and in the future, rather than taking the information directly.

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

Homework, discussion, student reflection

Language of Instruction

Turkish

Course Policies and Rules

It is not compulsory to attend classes during the semester. If the evaluation is done through the project, 10% points can be deducted per day for the assignments submitted after the date announced by the course instructor. Weekly assignments or projects delivered over a total of 4 days will not be considered. On the other hand, the course instructor may consider giving up bonus points of up to 10% to students for positive situations such as positive and active participation, regular attendance to classes and participation in class activities.

Contact Details for the Lecturer(s)

Dr. Kürşat ARSLAN
Dokuz Eylül Üniversitesi
Bilgisayar ve Öğretim Teknolojileri Eğitimi Bölümü
Buca Eğitim Fakültesi-Sosyal Bina, Izmir, Türkiye
Email: kursat.arslan@deu.edu.tr (http://www.galloglu.com/)
Telefon: 0232 3012136
Oda: 207

Office Hours

not defined!

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 2 26
Preparing assignments 13 1 13
Preparing presentations 13 1 13
Midterm 1 5 5
Final 1 5 5
TOTAL WORKLOAD (hours) 114

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10
LO.11311151311
LO.21311151111
LO.31311151111
LO.41311151111
LO.51311151111

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