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 1011 INTRODUCTION TO COMPUTER SCIENCE I COMPULSORY 2 2 0 6

Offered By

Computer Science

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

PROFESSOR DOCTOR EMEL KURUOĞLU KANDEMIR

Offered to

Computer Science

Course Objective

Algorithms and History of computer, input / output units, data processing, storage, application and system software issues will be covered. 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 (C) 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 to Concepts of Computer Science
2 Numeric Systems
3 Algorithms and Flowcharts
4 Algorithms and Flowcharts (cont.)
5 Introduction to Programming: Data, Basic Data Types, Basic Operators, Statements, Input and Output
6 Decision Structures
7 Decision Structures (cont.)
8 Repetition Structures
9 Repetition Structures (cont.)
10 Arrays
11 Arrays (cont.)
12 Multi-Dimensional Arrays
13 Examination of Sample Programs
14 Examination of Sample Programs

Recomended or Required Reading

Textbook(s):
1. Rifat Çölkesen, Programlama Sanatı, Algoritmalar, Papatya yayıncılık, 2011.
2. Paul Deitel, Harvey Deitel, C How to Program, Pearson Education, 2017.

Supplementary Book(s):
1. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C., Introduction to Algorithms, The MIT Press, 2nd edition, 2001.
2. Vasif Vagifoğlu Nabiyev, Algoritmalar, Seçkin Yayınları, 2009.

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 VZ Vize
2 FN Final
3 BNS BNS VZ * 0.40 + FN * 0.60
4 BUT Bütünleme Notu
5 BBN Bütünleme Sonu Başarı Notu VZ * 0.40 + BUT * 0.60


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)

emel.kuruoglu@deu.edu.tr
fidan.nuriyeva@deu.edu.tr

Office Hours

Will be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Lectures 14 2 28
Tutorials 14 2 28
Preparation for final exam 1 25 25
Preparations before/after weekly lectures 14 3 42
Preparation for midterm exam 1 25 25
Final 1 2 2
Midterm 1 2 2
TOTAL WORKLOAD (hours) 152

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10PO.11PO.12PO.13
LO.15555
LO.25555
LO.35555
LO.45555
LO.55555

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