• 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 BIL 1014 FUNDAMENTALS OF PROGRAMMING COMPULSORY 3 1 0 6

Offered By

COMPUTER TECHNOLOGY

Level of Course Unit

Short Cycle Programmes (Associate's Degree)

Course Coordinator

DUYGU BAĞCI DAŞ

Offered to

COMPUTER TECHNOLOGY

Course Objective

The main objectives of this course are to teach the main concepts and components of algorithms using a programming language.

Learning Outcomes of the Course Unit

1   Describe the basic concepts of algorithms and programming 2   Compose an algorithmic solution of a given problem 3   Translate an algorithmic solution to a computer code (program) 4   Apply structural and functional rules to programming process 5   Use developed programs for solutions in mathematical and other fields

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 and Algorithms 2 Examples of Algorithms and Problem Solving 3 Flowharts 4 Programming Tools, Variables and Primitive Data types 5 Input-Output Operations, Basic Operators 6 Condition Statements 7 Loops 8 Solving Example Questions, Midterm Exam 9 Example Applications 10 Advenced Data Types and Usage 11 Subroutines 12 Recursive Programming 13 File Operations, Special Library Usage 14 Algorithm Complexity & Analysis

Recomended or Required Reading

Lecture notes

Planned Learning Activities and Teaching Methods

-Lecture -DVD,video vb. -Practice

Assessment Methods

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

Further Notes About Assessment Methods

None

Assessment Criteria

1- The understanding degree of students to learning outputs is evaluated by project,midterm exam and final exam.

Language of Instruction

Turkish

Course Policies and Rules

1. 70% of the courses required to attend. 2. All types of plagiarism (dishonesty) initiative, and the actual results in disciplinary action.

Contact Details for the Lecturer(s)

Öğr. Gör. Duygu BAĞCI DAŞ duygu.bagci@deu.edu.tr Tel: 0232 301 94 97

Office Hours

It will be announced later.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours) Lectures 13 3 39 Tutorials 13 1 13 Preparations before/after weekly lectures 13 4 52 Preparing assignments 1 7 7 Preparation for midterm exam 1 8 8 Preparation for final exam 1 20 20 Project Assignment 1 1 1 Midterm 1 1 1 Final 1 2 2 TOTAL WORKLOAD (hours) 143

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 PO.13 PO.14 PO.15 LO.1 5 5 3 5 3 3 3 3 3 LO.2 5 5 3 5 3 3 3 3 3 LO.3 5 5 3 5 3 3 3 3 3 LO.4 5 5 3 5 3 3 3 3 3 LO.5 5 5 3 5 3 3 3 3 3