• 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 END 1212 ALGORITHM DESIGN AND APPLICATIONS COMPULSORY 3 1 0 6

Offered By

Industrial Engineering

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

PROFESSOR DOCTOR ŞENER AKPINAR

Offered to

Industrial Engineering

Course Objective

Learning Outcomes of the Course Unit

1   Ability to learn the concept of algorithm. 2   Ability to prepare algorithms for various problems. 3   Ability to comprehend and use flow diagrams and conceptual codes. 4   Having knowledge about logical operators, decision structures, arrays, matrices and loops, which are the basic components of programming. 5   Ability to use and code basic programming components within an algorithm in a computer environment with the C++ programming language.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Course introduction, basic concepts of algorithms and programming. 2 Relationship of algorithm to problem solving and programming. 3 Algorithm design techniques: Verbal expression of algorithms 4 Algorithm design techniques: Flow diagrams 5 Algorithm design techniques: Pseudocodes 6 Input/output concepts; basic data types; constants and variables 7 Application: Input/output concepts; basic data types; constants and variables 8 Mathematical operators and operation priorities 9 Relational && Logical operators and decision structures 10 Application: Mathematical operators and operation priorities; Relational && Logical operators and decision structures 11 Loops 12 Arrays and matrices 13 Application: Arrays and matrices; loops 14 Laboratory application

Recomended or Required Reading

Vatansever, F., Algoritma Geliştirme ve Programlamaya Giriş, Seçkin Yayınevi, 2023.

Planned Learning Activities and Teaching Methods

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA 1 MTE MIDTERM EXAM 2 LAB LABORATORY 3 FIN FINAL EXAM 4 FCG FINAL COURSE GRADE MTE * 0.30 + LAB * 0.20 + FIN * 0.50 5 RST RESIT 6 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.30 + LAB * 0.20 + RST * 0.50

Further Notes About Assessment Methods

None

Assessment Criteria

30% Midterm + 20% Laboratory Application + 50% Final Exam

Language of Instruction

Turkish

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

sener.akpinar@deu.edu.tr

Office Hours

To be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours) Lectures 14 4 56 Preparations before/after weekly lectures 14 2 28 Preparation for midterm exam 1 15 15 Preparation for final exam 1 30 30 Preparing presentations 1 15 15 Final 1 2 2 Midterm 1 2 2 TOTAL WORKLOAD (hours) 148

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