LECTURER : MALOBE LOTTIN CYRILLE M
ANNEE ACADEMIQUE: 2025/2026 Tel : 677283965 /620002732
Email : [Link]@[Link]
CYCLE UDT
SPECIALITE CNSM
NIVEAU 1
SEMESTRE 1
INTITULE DU COURS CESP2201: OPERATING SYSTEMS
VOLUME HORAIRE 30H
Course Description
This course introduces the basic principles and structure of Operating Systems (OS) as the core interface
between users and computer hardware. It explains how operating systems manage resources such as
processors, memory, files, and input/output devices, and ensures efficiency, security, and concurrency.
Students gain practical understanding of process scheduling, memory management, file handling, and
system protection, with examples from Windows, Linux, and UNIX.
Objectives
Explain the role and structure of an operating system.
Identify and describe the main components of an OS (process, memory, file, I/O).
Explore concurrency, synchronization, and deadlock management.
Examine CPU scheduling and performance optimization techniques.
Understand OS security and protection mechanisms.
Apply theoretical concepts to real-world systems such as Linux and Windows.
Learning Outcomes
By the end of this course, students will be able to:
Describe OS architecture, functions, and process life cycle.
Analyze CPU scheduling algorithms (FCFS, SJF, RR, Priority).
Apply synchronization tools such as semaphores and monitors.
Explain memory management methods (paging, segmentation, virtual memory).
Understand file organization, disk scheduling, and I/O control.
Compare common operating systems in terms of performance and design.
Discuss protection and security mechanisms in multi-user systems.
Course Units and Hours
Unit Headlines (Topics Covered) Hours
Unit 1 – Introduction to Definition and purpose of an OS; system components; system 5h
Operating Systems calls; OS structure (monolithic, layered, microkernel); OS types
(batch, time-sharing, real-time, distributed).
Unit 2 – Processes and Process concept, states, PCB, context switching; threads and 5h
CPU Scheduling concurrency; CPU scheduling algorithms (FCFS, SJF, RR,
Priority); performance metrics.
Unit 3 – Process Critical section problem; synchronization tools (semaphores, 5h
Synchronization and monitors); classic problems; deadlock detection, prevention,
Deadlocks and avoidance.
Unit 4 – Memory Contiguous/non-contiguous allocation; paging, segmentation, 5h
Management and Virtual swapping; virtual memory; page replacement (FIFO, LRU,
Memory Optimal); thrashing.
Unit 5 – File Systems and File structure; directory organization; file access methods; disk 5h
I/O Management scheduling (FCFS, SSTF, SCAN, C-SCAN); I/O control and
buffering.
Unit 6 – Security, Protection domains, access control, authentication, encryption; 5h
Protection and Case system performance tuning; comparative study of Windows &
Studies Linux.
Total Lecture Hours = 30 h | Practical (embedded) | Personal Work = 6 – 8 h
Weekly Schedule (8 Sessions × 4 Hours)
Session Lecture Focus Practical / Self-Study Activity
1 Introduction to Operating Systems – Identify and summarize main OS categories
objectives, types, and architecture. (batch, time-sharing, real-time, distributed).
2 OS services and system calls – structure Explore system calls using Linux command
and layered design. examples; summarize OS service layers.
3 Processes and threads – creation, Simulate CPU scheduling (FCFS, SJF, RR) using a
scheduling, context switching. spreadsheet or pseudo-code.
4 Process synchronization and deadlocks. Model semaphore-based producer–consumer
problem; draw a resource allocation graph.
5 Memory management – allocation and Simulate paging & page replacement (FIFO,
paging concepts. LRU); analyze thrashing effects.
6 Virtual memory and performance Calculate page faults under different policies;
optimization. compare performance results.
7 File systems and I/O management. Design a directory tree; simulate disk
scheduling (SCAN and C-SCAN).
8 Security & Protection Mechanisms – Compare Linux and Windows OS structures
Case Study & Revision. (focus on process and memory management).
Assessment Scheme
Continuous assessment (quizzes, assignments) — 20 %
Practical / Lab Exercises — 20 %
Mid-Semester Test — 20 %
Final Examination/ Project— 40% %
Total = 100 %
References (Free / Open Resources)
Silberschatz, Galvin & Gagne — Operating System Concepts, Wiley (Open eBook).
William Stallings — Operating Systems: Internals and Design Principles, Pearson.
Andrew S. Tanenbaum — Modern Operating Systems, Prentice Hall.
GCFGlobal & GeeksforGeeks — Operating System Tutorials.
Linux Kernel Documentation: [Link]
Microsoft Learn: Windows OS architecture and process management.
NPTEL OpenCourse: Operating System Fundamentals.