Infolink University College

Department of Computer Science

Course Title: Operating System

Course Code: CoSc 3023

Credit Hrs.: 3 ECTS: 5 Lecture Hrs.: 2 Lab Hrs.: 3 Tutorial Hrs. 2

Instructor’s Information: Mekia D. (MSc.)

Email:[email protected]
Course information: Academic Year: 2017 E.C ; Class Year: 3rd; Semester: II class room:17
Prerequisite: CoSc2022 Computer Organization and Architecture
Course Description: The aim of this course is to provide a unified introduction to Operating
System, process and Thread, process scheduling, inter-process communication; CPU
scheduling, scheduling criteria, scheduling algorithms; process synchronization, the critical
section problem, monitors, classical synchronization problems; deadlocks, avoidance,
prevention, detection; memory management, physical and virtual memory, swapping, allocation,
paging, segmentation;

Learning Outcomes
By the end of this course, students will be able to:
➢ Explain the objectives and functions of modern operating systems
➢ Describe the functions of a contemporary operating system with respect to convenience,
efficiency, and the ability to evolve.
➢ Explain the different states that a task may pass through and the data structures needed to
support
➢ Have knowledge of managing many tasks.
➢ Explain conditions that lead to deadlock.
➢ Compare and contrast the common algorithms used for both preemptive and non-preemptive
➢ Understanding scheduling of tasks in operating systems, such as priority, performance
comparison, and fair-share schemes.
➢ Explain the concept of virtual memory and how it is realized in hardware and software

Course outline
Course Content weeks Reference Book
Chapter 1: Introduction
➢ Andrew
1.1. what is operating systems Tanenbaum,
1.2. The structure of computer system
1.3. Computer Architecture Modern
1.4. Operating system mode Operating
1.5. Function of operating system 1-2
1.5.1. Process management Systems, 2nd
1.5.2. Memory management Edition,
1.5.3. File management
1.5.4. Device management or i/o USA,Prentic
management e-Hall, 2001
1.5.5. Security and protection
➢ Abraham Silberschatz, P.B. Galvin
1.5.6. User interface mechanism
and G. Gagne, Operating Systems
1.6. History of operating system
Concepts, 6 th Edition, John
1.7. Types of operating systems Wiley&Sons ,2006
1.7.1. Batch operating system
1.7.2. Multiprogramming operating
system
1.7.3. Time sharing operating system
1.7.4. Multiprocessing operating system
1.7.5. Distributed operating system
1.7.6. Network operating system
1.7.7. Real time operating system
1.7.8. Embedded operating system
1.8. Popular type of operating system
1.8.1. Desktop class operating system
1.8.2. Server class operating system
1.8.3. Mobile class operating system
 ➢ William Stallings,
Chapter 2: Processes and process management operating Systems:
2.1. Process concept Internals and Design
2.2. Process management Principles, 5th Edition,
2.2.1. Process context and PCB Prentice-Hall, 2005
2.3. Inter-process Communication (IPC)
2.3.1. Message passing & shared memory
2.3.2. Unicast and multicast IPC
2.3.3. Race condition 3-4
2.3.4. Critical section &mutual exclusion
2.4. Thread
2.5. Thread vs. Process
2.6. Thread implementation
Chapter 3: Process scheduling and Deadlock 5-6 ➢ Abraham Silberschatz, P.B. Galvin
3.1. Process scheduling and G. Gagne, Operating Systems
3.2. Preemptive and non-preemptive scheduling Concepts, 6 th Edition, John
3.3. Scheduling criteria Wiley&Sons ,2006
3.4. Scheduling Algorithm in Batch system
3.4.1. FCFS and SJF
3.4.2. Shortest remaining time first
3.4.3. Three level Scheduling
3.5. Scheduling in interactive system
3.5.1. Round robin and priority
3.5.2. Multiple queuing
3.5.3. Shortest process next
3.5.4. Guaranteed Scheduling
3.6. Real time Scheduling
3.7. Deadlock
3.8. Deadlock Necessary condition
3.9. Deadlock detection, prevention & Avoidance
Chapter 4: Memory Management 7-8 Abraham Silberschatz, P.B. Galvin
4.1. Over view of physical memory and memory and G. Gagne, Operating Systems
management Concepts, 8 th Edition, John
4.1.1. Hard ware overlays Wiley&Sons ,2009
4.1.2. Swapping
4.1.3. Partitioning
4.2. Paging and Segmentation
4.2.1. Page replacement & replacement policies
4.3. Working set and thrashing
4.4. Caching
Chapter 5: Device Management 9-10 Abraham Silberschatz, P.B. Galvin
5.1. Characteristics of parallel and serial devices and G. Gagne, Operating Systems
5.2. Buffering strategies Concepts, 8 th Edition, John
5.3. Direct memory access Wiley&Sons ,2009
5.4. Recovery from failure
Lab Activity and Required software 11-14
and/or hardware tools
Basics of UNIX commands,
C Program to simulate UNIX commands,
Shell Programming, and
C programs to implement Different
Scheduling algorithm,
implementation of deadlock avoidance
algorithms.
Required software: Linux/ UNIX or
Dev C++, Net bean
Final examination week 15-16
Assessment The evaluation shall be based on both formative and summative assessment which
Criteria include:

Assessment Form Forms % of credit allotted

Quizzes 10%
Mid examination 15%
Practical exam 15%
End semester project 10%
Final Exam 50%
Total 100%