COURSE UNIT TITLE

: COMPUTER PROGRAMMING I

DEGREE PROGRAMMES

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
BIL 2203 COMPUTER PROGRAMMING I COMPULSORY 2 2 0 5

Offered By

Statistics

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

INSTRUCTOR ALPER VAHAPLAR

Offered to

Statistics
Statistics(Evening)

Course Objective

This course provides students who have basic knowledge about algorithm development and computer-oriented problem solving methodologies, to application development and structured programming concepts and design techniques.

Learning Outcomes of the Course Unit

1   Describing the syntax of the programming language,
2   Using control structures,
3   Writing computer program for an algorithm,
4   Developing function and procedure,
5   Debugging,
6   Developing applications for essential statistical methods.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Algorithms and Their History Origin of the word Algorithms by the ancients The basic features of the algorithm
2 Number Systems and Basic Structures in Algorithms Binary, octal, hexadecimal etc. number systems and conversion Order, selection, repeat structures
3 Flow-Chart Diagrams Start and end symbols Arrows Input and output symbols Conditional symbol
4 Introduction to Turbo Pascal Programming Language Programming environment
5 Data Types, Variables and Pointers Data types Constants
6 Operators and Expressions Arithmetic operators Relational operators
7 Logical operators, Flow-Control Statements
8 Mid-term exam
9 Conditional statements Select statements
10 Loop statements
11 Arrays and Structured Data Types Multi-dimensional arrays
12 Procedures and Functions
13 Recursive functions
14 File operations

Recomended or Required Reading

Textbook(s): Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C., Introduction to Algorithms, The MIT Press; 2nd edition, 2001.
Supplementary Book(s): Koffman, B., Turbo Pascal, 5th Edition Update, Addison-Wesley Longman, Inc., 1998

Planned Learning Activities and Teaching Methods

The course is taught in a lecture, class presentation and discussion format. Besides the taught lecture, group presentations are to be prepared by the groups assigned and presented in a discussion session. In some weeks of the course, results of the homework given previously are discussed.

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA
1 MTE MIDTERM EXAM
2 ASG ASSIGNMENT
3 FIN FINAL EXAM
4 FCG FINAL COURSE GRADE MTE * 0.40 + ASG * 0.10 + FIN * 0.50
5 RST RESIT
6 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.40 + ASG * 0.10 + RST * 0.50

Further Notes About Assessment Methods

None

Assessment Criteria

If needed, other assessment methods can be added to the table given below.

Language of Instruction

English

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

alper.vahaplar@deu.edu.tr
efendi.nasibov@deu.edu.tr

Office Hours

Will 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 12 1 12
Preparation for midterm exam 1 10 10
Preparation for final exam 1 15 15
Preparing assignments 2 15 30
Final 1 2 2
Midterm 1 2 2
TOTAL WORKLOAD (hours) 123

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10PO.11PO.12PO.13PO.14
LO.15325
LO.25325
LO.35325
LO.45325
LO.55325
LO.653325

CONTACT INFORMATION
Dokuz Eylül Üniversitesi Cumhuriyet Bulvarı No: 144 35210 Alsancak / İZMİR
Phone: +90(232) 412 12 12 - Fax: +90 (232) 464 81 35

Copyright 2015 DEÜ. BİD

HOME / ABOUT US / DEGREE PROGRAMMES / GENERAL INFORMATION FOR STUDENTS / INTERNATIONAL RELATIONS