• 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 CME 1202 COMPUTER PROGRAMMING COMPULSORY 2 2 0 4

Offered By

Computer Engineering

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSISTANT PROFESSOR KÖKTEN ULAŞ BIRANT

Offered to

Metallurgical and Materials Engineering

Course Objective

The aim of this course is to introduce the fundamental concepts and structures of the computer programming as flow charts, variables, arrays, comparison and loop structures and to reach a solution by using these structures within a mathematical perspective for the encountered problems.

Learning Outcomes of the Course Unit

1   Analyze the encountered problems from a mathematical perspective 2   Analyze the problems step by step to solve it 3   Design the proper algorithm at the end of step by step analysis of the problem 4   Apply the fundamental concepts and structures of the computer programming as flow charts, variables, arrays, comparison and loop structures to reach a solution algorithm 5   Develop alternative solutions for the encountered problems

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Introduction to Algorithm, Flow Charts 2 Variables, Basic Read-Write Commands 3 If .. Then .. Else Control Structure 4 Loops, Goto 5 Compound Examples 6 Do - Loop Structure 7 For - Next Structure 8 Compound Examples 9 Arrays 10 Compound Examples 11 Function - Subroutine 12 Compound Examples 13 Strings and strings' functions 14 Compound Examples

Recomended or Required Reading

Deitel, H., Deitel, P., Nieto, T. "Visual Basic.NET How to Program", Second Edition. Prentice Hall. 2001. ISBN-10: 0130293636

Planned Learning Activities and Teaching Methods

Lecture, guided practice

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA 1 MTE MIDTERM EXAM 2 FIN FINAL EXAM 3 FCG FINAL COURSE GRADE MTE * 0.50 + FIN * 0.50 4 RST RESIT 5 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.50 + RST * 0.50 *** Resit Exam is Not Administered in Institutions Where Resit is not Applicable.

Further Notes About Assessment Methods

None

Assessment Criteria

To be announced.

Language of Instruction

English

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

Computer Engineering Department, Room 209 and 108. Phone: 3017422 and 3017416 e-mail: ulas@cs.deu.edu.tr and tanzer@cs.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 Tutorials 13 2 26 Preparations before/after weekly lectures 13 2 26 Preparation for midterm exam 1 6 6 Preparation for final exam 1 10 10 Final 1 2 2 Midterm 1 2 2 TOTAL WORKLOAD (hours) 98

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