• 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 EED 1010 ALGORITHMS & PROGRAMMING COMPULSORY 2 2 0 4

Offered By

Electrical and Electronics Engineering

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSISTANT PROFESSOR METEHAN MAKINACI

Offered to

Electrical and Electronics Engineering

Course Objective

This course is designed for providing students, who have basic level of knowledge in computer programming subject, to have more advanced level of knowledge. Advanced programming concepts and structures will be introduced to the student by using C programming language in this course.

Learning Outcomes of the Course Unit

1   Being able to define structures in C programming language. 2   Being able to solve problems related with strings by using computer. 3   Being able to use C preprocessor directives. 4   Being able to examine C programs that include file processing applications. 5   Being able to predict an algorithm that is necessary in order to solve a problem. 6   Being able to develop a program by using data structures in C language.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

EED 1005 - INTRODUCTION TO PROGRAMMING

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Strings (fundamentals, character handling library, conversion fns, input/output fns). 2 Strings (manipulation fns, comparison fns, search fns, memory fns, other fns). 3 Formatting input and output. 4 Structures and unions. 5 Bitwise operators, enumeration. 6 Sequential-access files. 7 Random-access files. 8 Midterm 9 Linked lists. 10 Linked lists. 11 Stacks. 12 Queues. 13 Trees. 14 C preprocessor.

Recomended or Required Reading

C: How to Program,Paul Deitel ,Harvey M. Deitel, ,Prentice Hall,0136123562,2009

Planned Learning Activities and Teaching Methods

Lecture + Comp Lab.

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.25 + LAB * 0.25 + FIN * 0.50 5 RST RESIT 6 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.25 + LAB * 0.25 + RST * 0.50 *** Resit Exam is Not Administered in Institutions Where Resit is not Applicable.

Further Notes About Assessment Methods

None

Assessment Criteria

Exams + Lab quiz

Language of Instruction

English

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

metehan.makinaci@deu.edu.tr hakki.yalazan@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 14 2 28 Preparations before/after weekly lectures 12 2 24 0 Preparation for final exam 1 10 10 Preparation for midterm exam 1 8 8 Midterm 1 2 2 Final 1 2 2 TOTAL WORKLOAD (hours) 100

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