COURSE UNIT TITLE

: OPERATING SYSTEMS

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
ELECTIVE

Offered By

Computer Engineering

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSISTANT PROFESSOR YUNUS DOĞAN

Offered to

Computer Engineering

Course Objective

This course introduces the basic operating system concepts such as processes and process synchronization, mutual exclusion, semaphores, process management and process scheduling, memory management, virtual memory and paging, interrupt structures and interrupt processing, device management, I/O systems and I/O processing.

Learning Outcomes of the Course Unit

1   Understand the fundamental methods used in modern operating systems.
2   Chose a propoer operating system for a given situation or application, copratively.
3   To design and implement some parts of operating system, or modify or extend a part of operating.
4   To use operating system API from application programs.
5   To be able to develop multithread application and take care some syncronization issues in multicore architectures.
6   Understand basic resource management techniques (scheduling or time management, space management) and their implementation details.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

CME 2206 - COMPUTER ARCHITECTURE

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Introduction to Operating Systems
2 Evolution of Operating Systems
3 Process Concept
4 Process and Threads
5 Process Synchronization
6 Process Scheduling Algorithms
7 IPC and Deadlock
8 Memory management
9 Memory management
10 Memory management algoirthms
11 Input/Output systems
12 File Systems
13 Multicore Operating system
14 Security and Container Concept

Recomended or Required Reading

Andrew S. Tanenbaum, Modern Operating Systems: Design & Implementation, Second Edition, Prentice Hall

Planned Learning Activities and Teaching Methods

Presentation/Lectures, Interactive discussion, programming assignments

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


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)

Yunus DOĞAN,
Dokuz Eylul Universitesi, Bilgisayar Müh. Bölümü
Tınaztepe Kampüsü,
35390 Buca Izmir
Tel: (232) 3017418

Office Hours

Monday 10:20-12:00

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Tutorials 14 2 28
Lectures 14 2 28
Preparations before/after weekly lectures 12 2 24
Preparation for midterm exam 1 16 16
Preparing assignments 3 16 48
Preparation for final exam 1 8 8
Midterm 1 2 2
Final 1 2 2
TOTAL WORKLOAD (hours) 156

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10
LO.15353
LO.253533
LO.3535533
LO.453553
LO.553553
LO.653533