COURSE UNIT TITLE

: ALGORITHMS AND PROGRAMMING

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
EHE 4108 ALGORITHMS AND PROGRAMMING COMPULSORY 1 1 0 3

Offered By

Telecommunication Technology

Level of Course Unit

Short Cycle Programmes (Associate's Degree)

Course Coordinator

ÖZGÜR ÖZ

Offered to

Telecommunication Technology
Telecommunication Technology (Evening)

Course Objective

It is aimed that students will have knowledge about basic algorithms and problem solving structures, design algorithms using appropriate data structures when faced with a problem, and gain knowledge and skills in programming on different platforms.

Learning Outcomes of the Course Unit

1   To be able to create a solution path for a problem.
2   To be able to draw a flow diagram for the solution of a problem.
3   To be able to match the basic commands and tasks of the programming language to be used.
4   Create a program using decision commands.
5   To be able to create a program using loop commands.
6   To be able to use numeric and character arrays, pointer variables.
7   To be able to write programs using functions.
8   To be able to create files with program results.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Introduction to programming environment, program-memory-processor relationship, programming tools
2 Inputting data, outputting data, storing values in variables in memory, using variables and constants
3 Introducing the flowchart and algorithm and the function relation used
4 Design programs using operators, mathematical operations, pseudocode and flowcharts
5 Design programs using operators, mathematical operations, pseudocode and flowcharts
6 Learning program selection (decision) and loop structures
7 Learning program selection (decision) and loop structures
8 MID TERM EXAM
9 Dividing programs into subroutines, writing subroutines, introducing other code platforms.
10 Using arrays, word strings, address variables
11 Using arrays, word strings, address variables
12 Sequential files and Random Access Files
13 Multi-file project applications
14 Serial/Parallel port communication and data collection and writing from other media
15 Application

Recomended or Required Reading

Main Sources:

1. Introduction to Algorithm Development and Programming, F. Vatansever, Seçkin Publishing, 2011
2. GNU Octave (https://octave.org/)

Helpful Sources:

1. Algorithm Development and Data Structures, Bülent Çobanoğlu, Pusula Publishing, 2009
2. Numerical Computing and Coding with Octave, Prof. Dr. Erhan Coşkun, (pdf)
3. Introduction to Algorithms and Programming Lecture Notes, Assoc. Prof. Dr. Ibrahim Küçükkoç, (pdf)

Other Course Materials:

1. Flowchart Template Ruler
2. Computer
3. Algorithm Programs (Flow Chart Visual Programming Language)

Planned Learning Activities and Teaching Methods

1. Lecturing
2. Project Development

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA
1 MTE MIDTERM EXAM
2 RO Rapor/Ödev
3 FN Final
4 FCG FINAL COURSE GRADE VZ*0.20 + RO*0.20 + FN* 0.60
5 RST RESIT
6 FCGR FINAL COURSE GRADE (RESIT) VZ*0.20 + RO*0.20 + BUT* 0.60


*** Resit Exam is Not Administered in Institutions Where Resit is not Applicable.

Further Notes About Assessment Methods

None

Assessment Criteria

Eight learning outcomes will be measured by midterm exam, project report and final exam and the student's progress will be monitored.

Language of Instruction

Turkish

Course Policies and Rules

1. Attendance to 70% of the theoretical courses and 80% of the practical courses is compulsory.
2. Any act of cheating will result in a disciplinary investigation.

Contact Details for the Lecturer(s)

Phone: 0 232 301 26 22
E-mail: ozgur.oz@deu.edu.tr

Office Hours

The announcement of the days and times determined to be not less than 2 hours per week will be made to the students at the beginning of the semester.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Lectures 14 1 14
Tutorials 14 1 14
Preparations before/after weekly lectures 14 1 14
Preparation for midterm exam 1 10 10
Preparation for final exam 1 10 10
Project Preparation 1 10 10
Final 1 1 1
Midterm 1 1 1
Project Assignment 1 1 1
TOTAL WORKLOAD (hours) 75

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10PO.11PO.12
LO.11111
LO.21111
LO.31111
LO.41111
LO.51111
LO.61111
LO.7
LO.8