Organization: Ref.

No:

HiLCoE Doc No. CD/HiL/001

Version: 001
School of Computer Science & Technology
Title:
Page 1 of 3
Course Outline
Course Code CS363
Course Title Operating Systems
Program Computer Science BSc.
Objectives After completing this course students should be able to:
 Understand the meaning and history of operating system,
 Describe a process and a thread and the role of processes and threads in
system management,
 Describe common inter-process communication and synchronization
methods,
 Describe common process scheduling algorithms,
 Understand the problem of deadlocks,
 Describe the implementation of virtual memory as used in contemporary
multi-process computer systems and some of the critical problems that
need to be considered in the design of these systems.
 Describe the main issues of operating systems to handle I/O devices.
 Explain the goals of file-system design and the ways in which several
operating systems meet these goals.
 Discuss the need for security in computer systems in the historical context
and discuss several threats and methods of overcoming those threats
Reference Materials 1. Tanenbaum, Andrew, “Modern Operating Systems”, 2 nd edition,
Prentice-Hall, 2001.
2. William Stallings, “Operating Systems”, 4th edition, 2002
3. A Silberschatz, Peter B Galvin, G Gagne: Operating System Concepts, 9th
edition
4. A.M. Lister and R.D Eager: Fundamentals of Operating Systems.
Assessment Method  Assignments
 Mid Exam
 Final Exam
Year 2023
Term Spring
Instructor Tilahun Yeshambel (tilahun.yeshambel@gmail.com)

COURSE CONTENT
Chapter 1: Overview of an operating System
1.1 Definition of OS
1.2 Components of OS
1.3 Types of OS
1.4 Function of OS

Chapter 2: Process management

2.1 Process concept
 Organization: Ref. No:

HiLCoE Doc No. CD/HiL/001

Version: 001
School of Computer Science & Technology
Title:
Page 2 of 3
Course Outline
2.2 Process state and transition
2.3 Process contro block(PCB)
2.4 Cooperating process
2.5 Thread

Chapter 3: CPU Scheduling

3.1 Introduction to scheduling
3.2 I/O burst cycle
3.3 Context Switching
3.4 Scheduling Criteria
3.5 Scheduling algorithm Algorithms
3.5.1 First Come First Serve
3.5.2 Shortest Job First
3.5.3 Priority Scheduling
3.5.4 Round Robin

Chapter 4: Concurrency and Synchronization

4.1 Inter process communication
4.2 Concurrency
4.3 Process Synchronization
4.4 Race condition
4.5 Critical section
4.6 Mutual Exclusion
4.7 deadlock

Chapter 5: Memory management

5.1 Introduction to memory management
5.2 Partitioning
5.3 Paging and segmentation
5.4 Virtual memory
5.5 Swapping

Chapter 6: File management Systems

6.1 File Organizations

Chapter 7: Security and protection

7.1 Security Problem
7.2 Authentication
7.3 Securing Systems
 Organization: Ref. No:

HiLCoE Doc No. CD/HiL/001

Version: 001
School of Computer Science & Technology
Title:
Page 3 of 3
Course Outline
7.4 Intrusion Detection

Chapter 8: Input Output System

8.1 Principles of I/O hardware and software
8.2 I/O Requests Handling
8.3 I/O Requests Handling

References
1. Andrew s. Tanenbaum and Herbert Bos .Modern operating systems. Fourth edition.
2. Operating Systems Concepts, Fifth Edition; Silberschatz and Galvin

Evaluation:
 80 % is exam
 20% assignment