COURSE UNIT TITLE

: INTRODUCTION TO COMPUTER SCIENCE I

DEGREE PROGRAMMES

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
BIL 1001 INTRODUCTION TO COMPUTER SCIENCE I COMPULSORY 4 0 0 7

Offered By

Computer Science

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASISTANT PROFESSOR RESMIYE NASIBOĞLU

Offered to

Computer Science

Course Objective

Algorithms and History of computer, input / output units, data processing, storage, application and system software issues will be addressed. Provide students with an understanding of basic concepts in computer science and engineering, programming languages, data structures and control mechanisms aimed to familiarize. Examples and exercises in a functional programming language (Turbo Pascal, etc.) will be made.

Learning Outcomes of the Course Unit

1   Have a good understanding of basic concepts in computer science.
2   Have a good understanding about the concept of the algorithm.
3   Have a basic knowledge of data types.
4   Have ability to use computer programming structures.
5   Have ability to design and test application codes in a programming language.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Introduction
2 Numeric Systems Binary, octal, hexadecimal numeric systems and their conversions
3 Algorithms and their properties Flow-Chart Diagrams
4 Examination of Sample Algorithm Algorithm Design
5 Introduction to Programming: Data, Basic Data Types Basic Operations, Statements, Input and Output
6 Decision Structures: Single and Dual Alternative decision structures
7 Decision Structures: Multiple and nested decision structures
8 Mid-term exam
9 Repetition Structures: Condition controlled loops
10 Repetition Structures: Count controlled loops and nested loops
11 Arrays: One-dimensional arrays
12 Arrays: Two-dimensional and multi-dimensional arrays
13 Searching and sorting algorithms
14 Searching and sorting algorithms (continues to )

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):
Rıfat Çölkesen, C programlama dili, Papatya, 2010.

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.20 + ASG * 0.40 + FIN * 0.40
5 RST RESIT
6 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.20 + ASG * 0.40 + RST * 0.40

Further Notes About Assessment Methods

None

Assessment Criteria

To be announced.

Language of Instruction

Turkish

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

efendi.nasibov@deu.edu.tr
murat.berberler@deu.edu.tr

Office Hours

Will be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Lectures 13 4 52
Preparation for final exam 1 20 20
Preparations before/after weekly lectures 13 4 52
Preparation for midterm exam 1 10 10
Preparing assignments 4 8 32
Final 1 2 2
Midterm 1 2 2
TOTAL WORKLOAD (hours) 170

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10PO.11PO.12PO.13
LO.1545355455
LO.255525455
LO.3554355
LO.455332255
LO.54554345

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