Scribd
Upload
36 views4 pages

Feleke Operating System Course Plan 2025

The document outlines the course details for Operating Systems (COSC 3052) at Unity University, including prerequisites, credit hours, and course objectives. It covers key topics such as process management, memory management, CPU scheduling, deadlocks, I/O device management, and security issues. The document also includes grading criteria and recommended textbooks for the course.

Uploaded by

kaleabtewelde416
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
36 views4 pages

Feleke Operating System Course Plan 2025

The document outlines the course details for Operating Systems (COSC 3052) at Unity University, including prerequisites, credit hours, and course objectives. It covers key topics such as process management, memory management, CPU scheduling, deadlocks, I/O device management, and security issues. The document also includes grading criteria and recommended textbooks for the course.

Uploaded by

kaleabtewelde416
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Unity University

Faculty of Engineering, Technology and


Computational Sciences

Department of Computer Science

Course Title: Operating Systems


Course number: COSC 3052
Credit hours: 3
Contact hours: 4 (2 Lect. & 2 Labs)
Prerequisite: COSC 3061, COSC 2042,
Laboratory: Required

Course description
This course is designed to acquaint students with the basic design principles and
implementation issues of Computer Operating Systems (OS). Course topics include:
Functions and evolution of OS, Process management (processes, threads, process
synchronization, CPU-scheduling, deadlock), memory management (paging, segmentation,
virtual memory), input-output-device management, hard-disk management, managing file
systems, security and protection issues in a computer system.

Course objectives
After completing this course, the student will be able to:
 Describe the functions of modern operating systems (OSs;
 Explain the evolution of OS;
 Differentiate different OS services;
 Compare various types of OS design structures;
 Describe process-state and process-context-switching; Compare process and thread;
 Discuss about inter-process communication;
 Differentiate various CPU-Scheduling algorithms;
 Discuss about Deadlocks(conditions, detection, prevention, avoidance);
 Explain various memory management techniques (including virtual memory);
 Describe how to manage input-output devices ;
 Compare various hard-disk scheduling algorithms;
 Explain File systems and explain different file allocation methods;
 Describe protection and security issues in a computer system.

Source: Feleke Merin (Dr.―Engr.) Page 1


Unity University

Course contents
1. Introduction to Operating System (OS)
1.1 Definition and functions of an operating system
1.2 Evolution of Operating Systems (from 1st generation to modern OS)
1.3 Major Computer hardware components (review)
1.4 OS major software components
1.5 OS design structures (monolithic, layered, virtual machine, micro-kernel)
1.6 OS services, system calls, system programs
1.7 Operating system design goals and implementation

2. Process and thread management


2.1 Role of OS with regard to process mgmt.
2.2 Process Concept (Process vs program, Process state model, Process Control Block)
2.3 Process scheduling, creation, and termination
2.4 Operation on processes
2.5 Inter-process communication
2.6 Reasons for process creation and termination
2.7 Threads
2.7.1 Threads concept and benefits of multi-threading
2.7.2 Implementation of threads (User-level, Kernel-level, Hybrid thread model )
2.8 Difference between process and threads

3. CPU-Scheduling (Single processor scheduling)


3.1 Basic concepts of CPU-Scheduling
3.2 Scheduling criteria
3.3 Types of scheduling(preemptive, nonpreemptive, long term, short term, medium scheduler)
3.4 CPU-Scheduling algorithms(FCFS, SJF, Priority, RR)
3.5 Multi-level feedback queue scheduling
3.6 Comparison of scheduling algorithms

4. Process synchronization and interprocess communication


4.1 Process synchronization
4.2 Synchronization hardware
4.3 Critical section (CS)
4.4 Race condition in process synchronization
4.5 Implementing critical section
4.6 Classical problems of process synchronization
4.7 Algorithmic approach to implement critical sections
4.8 Semaphores
4.9 Language mechanisms for synchronization (monitors)
4.10 Interprocess communication through message passing

Source: Feleke Merin (Dr.―Engr.) Page 2


Unity University

5. Deadlocks
5.1 Deadlock definition, system model
5.2 Deadlock conditions and Modeling using RAG
5.3 Methods for handling deadlocks
5.4 Deadlock prevention, avoidance, detection, recovery

6. Memory management
6.1 Role of OS in relation to memory management
6.2 Logical versus physical address space
6.3 Contiguous memory allocation (fixed size, variable size)
6.4 Memory allocation algorithms (Best-fit, first-fit, worst-fit)
6.5 Non-Contiguous memory allocation
6.5.1 Paging concept, paging hardware
6.5.2 Segmentation concept, segmentation hardware
6.5.3 Paging with segmentation combined

7. Virtual memory
7.1 Need for virtual memory technique
7.2 Virtual memory (using demand paging, demand segmentation, page table)
7.3 Page replacement algorithms (Optimal, NRU, FIFO, LRU)
7.4 Thrashing (causes, effects of thrashing, how to avoid it)

8. Input / Output device management


8.1 Role of OS in relation to I/O device mgmt; examples of I/O devices
8.2 Design goals of I/O software module (which is part of an operating system)
8.3 Techniques used for performing Input / Output (programmed, Interrupt, DMA)
8.4 Characteristics of serial and parallel devices
8.5 Input / Output Buffering (single, double, circular buffering)
8.6 Hard-disk
8.6.1 Hard-disk physical structure
8.6.2 Hard-disk performance parameters
8.6.3 Disk-arm scheduling algorithms (FCFS, SSTF, SCAN, C-SCAN, C-LOOK )
8.6.4 Disk management (Formatting, boot block); Disk cache

9. File system management


9.1 File concepts (naming, structure, types, attributes, organization)
9.2 File access methods (sequential, random)
9.3 Directory structures (single, two-level, tree, path names)
9.4 File system implementation
9.5 File allocation methods(contiguous, linked, I nodes)
9.6 File space mgmt (how the operating system manages free hard-disk spaces)

Source: Feleke Merin (Dr.―Engr.) Page 3


Unity University

10. System protection and security


10.1 Goals of protection
10.2 Security threats
10.3 User authentication (how to use magnetic card, tokens, Biometrics)
10.4 Malware (types, symptoms, how they spread, how to avoid)
10.5 Securing your computer system (Antivirus, Firewalls, Encryption)

 Text book:
 Abraham Silberschatz; Peter Baer Galvin; Greg Gagne;
“Operating System Concepts”; John Wiley & Sons Inc. , USA, 10th Edition, 2018.

 Reference books
1. Andrew S. Tanenbaum ; Herbert Bos ;
“Modern Operating Systems”; Pearson Education Inc., USA, Fourth Edition, 2015.

2. William Stallings; “Operating Systems”; Pearson Education Inc. , India, Sixth


Edition, 2009.

 Web sites(s) that provides support for students and instructors


a) http://www.os-book.com
b) http://williamstallings.com/OS/OS6e.html
c) http://www.prenhall.com/tanenbaum

 Grades (based on continuous assessment marks)


a) Test_1 ---------15%;
b) Test_2 ---------15%;
c) LabTest ------10%;
d) Mini-project assignment (in groups): 5% (project will be presented to the class);
e) Class attendance: 5% (Missing classes for more than 20% of total contact hours will
lead to “No Grade”(the student will be dropped for the course);
f) Final Exam: 50%;
g) Grades are added to make 100%;
h) Final Grades (“A, B, C, D, F ” ) are evaluated based on University grading system.

The End!

Source: Feleke Merin (Dr.―Engr.) Page 4

You might also like