COURSE UNIT TITLE

: INTRODUCTION TO PROGRAMMING

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
EED 1005 INTRODUCTION TO PROGRAMMING COMPULSORY 2 2 0 5

Offered By

Electrical and Electronics Engineering

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSISTANT PROFESSOR HAKKI TARKAN YALAZAN

Offered to

Electrical and Electronics Engineering

Course Objective

This course is designed to introduce computer programming subject to students in basic level. Basic programming concepts and structures (variables, arrays, assignment, sequential-selective execution, loops, functions, and pointers) 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 basic structures of a programming language.
2   Being able to solve real problems by using computer.
3   Being able to create computer programs effectively in order to solve computational problems.
4   Being able to examine a program that is written in C language.
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 structural programming approach.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Introduction to C programming
2 Algorithms (pseudocode, flowchart)
3 Operators and expressions
4 Program control (if, if-else, switch statements)
5 Repetition (for, while, do while statements)
6 Repetition (nesting, break and continue)
7 Exercises on program control
8 Functions (definitions, prototypes, headers)
9 Functions (calling fns, scope rules, recursion)
10 Arrays (defining, examples, passing to fns)
11 Arrays (searching, sorting, multidimensional)
12 Midterm
13 Pointers (defining, operators, expressions)
14 Pointers (arrays of pointers)

Recomended or Required Reading

C: How to Program,Paul Deitel ,Harvey M. Deitel, Eight Ed., Pearson, ISBN: 1-292-11097-X, 2016.
Programming Logic and Design, Tony Gaddis, Fourth Ed., Pearson, ISBN: 0-13-398507-5, 2016.

Planned Learning Activities and Teaching Methods

Lecture + Laboratory

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

To be announced.

Language of Instruction

English

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

hakki.yalazan@deu.edu.tr
metehan.makinaci@deu.edu.tr

Office Hours

To be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Laboratory 12 2 24
Lectures 12 2 24
Preparation for midterm exam 1 12 12
Preparation for final exam 1 12 12
Preparations before/after weekly lectures 12 4 48
Midterm 1 2 2
Final 1 2 2
TOTAL WORKLOAD (hours) 124

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10PO.11PO.12PO.13
LO.15
LO.25554
LO.354
LO.45
LO.55
LO.6545