DEPARTMENT OF ARTIFICIAL INTELLIGENCE AND DATA SCIENCE

COURSE PLAN-INTEGRATED COURSE

Course Code CB3402

Course Name Operation Systems and Security
Regulation 2021
Name of the Course Instructor(s) V.PAVITHRA
Name of the Course Coordinator V.PAVITHRA
Academic Year: 2025-2026
Branch / Year / Semester CSE (Cyber Security) / II / IV
Date of Commencement of Class 21.02.25
Date of Completion of Class 30.05.25
Revision No 0|1|2

Prepared By, Approved By,

Mrs.V.Pavithra Dr.R.Deepalakshmi
AP/AI&DS Prof and Head-AI&DS

1
 SYLLABUS

COURSE
COURSE NAME L T P C
CODE
CB3402 OPERATING SYSTEMS AND SECURITY 3 0 2 4
COURSE OBJECTIVES:
 To understand the basic concepts of Operating Systems.
 To explore the process management concepts including scheduling, synchronization,
 threads and deadlock
 To understand the memory, file and I/O management activities of OS
 To understand the requirements of a trust model.
 To learn how security is implemented in various operating systems
UNIT I OPERATING SYSTEM OVERVIEW 9
Computer-System Organization – Architecture – Operating-System Operations – Resource
Management – Security and Protection – Distributed Systems – Kernel Data Structures – Operating-
System Services – System Calls – System Services – Why Applications Are Operating System Specific
– Operating-System Design and Implementation - Operating-System Structure – Building and Booting
an Operating System .
UNIT II PROCESS MANAGEMENT 9
Process Concept – Process Scheduling – Operation on Processes, Inter-process Communication –
Threads – Overview – Multithreading models – Threading issues; CPU Scheduling – Scheduling
criteria, Scheduling algorithms; Process Synchronization – critical-section problem, Synchronization
hardware, Mutex locks, Semaphores, Critical regions, Monitors; Deadlock – System model, Deadlock
characterization, Methods for handling deadlocks, Deadlock prevention, Deadlock avoidance,
Detection, Recovery
UNIT III MEMORY MANAGEMENT AND FILE SYSTEMS 9
Main Memory – Background, Swapping, Contiguous Memory Allocation, Paging, Segmentation –
Virtual Memory – Demand Paging, Page Replacement, Allocation, thrashing; Allocating Kernel
Memory. Mass Storage system - HDD Scheduling - File concept, Access methods, Directory Structure,
Sharing and Protection; File System Structure, Directory implementation, Allocation Methods, Free
Space Management
UNIT IV SECURE SYSTEMS AND VERIFIABLE SECURITY GOALS 9
Security Goals – Trust and Threat Model – Access Control Fundamentals – Protection System –
Reference Monitor – Secure Operating System Definition – Assessment Criteria – Information Flow –
Information Flow Secrecy Models – Denning’s Lattice Model – Bell LaPadula Model – Information
Flow Integrity Models – Biba Integrity Model – Low-Water Mark Integrity –Clark-Wilson integrity
UNIT V SECURITY IN OPERATING SYSTEMS 9
UNIX Security – UNIX Protection System – UNIX Authorization – UNIX Security Analysis – UNIX
Vulnerabilities – Windows Security – Windows Protection System – Windows Authorization –
Windows Security Analysis – Windows Vulnerabilities – Address Space Layout Randomizations –
Retrofitting Security into a Commercial Operating System – Introduction to Security Kernels.
TOTAL: 45 Periods
CONTENT BEYOND SYLLABI: MAC OS

2
 PRACTICAL EXERCISES TOTAL:30 periods
1.Illustartion of Basics of UNIX commands
2.Write programs using the following system calls of UNIX operating system
fork, exec, getpid, exit, wait, close, stat, opendir, readdir
3.Write a C programs to implement the various CPU Scheduling Algorithms
4. Write a C program to Implement Semaphores
5. Write a C program to Shared memory
6. Write a C program to Bankers Algorithm for Deadlock Detection &Avoidance
7. Write a C program to Implementation Memory Allocation Methods for fixed partition
a) First Fit
b) Worst Fit
c) Best Fit
8. Write a C program to Implement Page Replacement Algorithms
a) FIFO b) LRU c)LFU
9.Write a C Program to demonstrate the working of Bell LaPadula Model and Biba Integrity Model
10.Setting up access control lists of files and directories and testing the lists in Linux
11.Learn to enable and disable address space layout randomization
TOTAL:75 Periods

COURSE OUTCOMES:
After the successful completion of this course, the student will be able to
CO1: To gain understanding on the concepts of Operating Systems
CO2: To acquire knowledge on process management concepts including scheduling,
synchronization, threads and deadlock.
CO3: To have understanding on memory, file and I/O management activities of OS.
CO4: To understand security issues in operating systems and appreciate the need for security
models
CO5: To gain exposure to the operating systems security models of WINDOWS and UNIX
OS.

TEXT BOOKS:
T1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”,
John Wiley & Sons, Inc., 10th Edition, 2021.
T2. Trent Jaeger, Operating System Security, Morgan & Claypool Publishers series, 2008.

REFERENCE BOOKS/LINKS:
R1.Morrie Gasser, “Building A Secure Computer System”, Van Nostrand Reinhold, New York,
1988.
R2. Charles Pfleeger, Shari Pfleeger, Jonathan Margulies, "Security in Computing", Fifth
Edition, Prentice Hall, New Delhi, 2015.
R3. William Stallings, “Operating Systems – Internals and Design Principles”, 9th Edition,
Pearson, 2017.
R4. Michael Palmer, “G “Guide to Operating Systems Security”, Course Technology –
Cengage Learning, New Delhi, 2008
R5. Introduction to Hardware, Security and Trust, book by Mohammad Tehranipoor, Cliff
Wang, Springer, 2012.
R6. Gary McGraw, Software Security: Building Security In, Addison Wesley software security
series, 2005.
R7. Gerardus Blokdyk, Security Focused Operating System A Complete Guide - 2020 Edition,
5STARCooks, ISBN: 9781867373353, 2020.
3
 PLAN OF DELIVERY
Sl. Topic Covered Ref. Page No Hours Cumula Teaching Teaching
No Book tive Aid Methodology
Code Hours (If any)

UNIT-I
1. Computer-System T1 7-14 1 1 BB -
Organization
Architecture 15-20
2. Operating-System T1 20-26 1 2 BB -
Operations
Resource R3 72,73
Management
3. Security and T1 29-30 1 3 BB -
Protection
4. Distributed Systems T1 35 1 4 PPT+BB -
Kernel Data 36-40
Structures
5. Operating-System R3 70-73 1 5 BB -
Services
6. System Calls 62-73 2 7 PPT+BB Think Pair
T1 Share
System Services 74
7. Why Applications T1 77,78 1 8 PPT+BB Think Pair
Are Operating Share
System Specific
Operating-System T2 81-90
Structure
8. Building and Booting T1 92-94 1 9 BB
an Operating System -

UNIT-II

9. Process Concept R3 129-148 1 10 BB Think Pair

Share
Process Scheduling T1 110-115
10. Operation on T1 116-122 1 11 PPT+BB -
Processes
Inter-process 123-125
Communication
11. Threads – Overview R3 176-183 1 12 PPT+BB -
Multithreading T1 166-168
models
12. Threading issues T1 188-194 1 14 BB -
CPU Scheduling – R3 425-451 1
Scheduling criteria
Scheduling
algorithms
13. Process T1 257-260 1 15 BB -
Synchronization

4
Sl. Topic Covered Ref. Page No Hours Cumula Teaching Teaching
No Book tive Aid Methodology
Code Hours (If any)

critical-section 260-262
problem
Synchronization 265-270
hardware
14. Mutex locks, T1 270-272 1 16 PPT+BB -
Semaphores
Critical regions R3 244-257
Monitors 257-263
15. Deadlock-system T1 318, 1 17 BB Think Pair
Model 321-326 Share
Deadlock
Characterization
Methods for R3 290-298
handling deadlocks
16. Deadlock prevention R3 299-308 1 18 BB -
Deadlock avoidance
Detection, Recovery
UNIT-III
17. Main Memory T1 349-356 1 19 PPT+BB Think Pair
Background Share
Swapping 356-360
Contiguous Memory 376-378
Allocation
18. Paging, R3 355-358 1 20 PPT+BB -
Segmentation 358-359
Virtual Memory 370-371

19. Demand Paging T1 392-398 1 21 BB -

Page Replacement 401-413

Allocation 413-419
20. Thrashing T1 419-425 1 22 BB -
Allocating Kernel 426-429
Memory
Mass Storage system 449-456
21. HDD Scheduling T1 457-461 2 24 BB Think Pair
Share
R3 517-524
22. File concept T1 529-538 1 25 PPT+BB -
Access methods 539-540
Directory Structure 541-549
23. Sharing and T1 550-554 1 26 BB -
Protection
File System Structure 564-565
24. Directory T1 568-570 1 27 BB
implementation

5
Sl. Topic Covered Ref. Page No Hours Cumula Teaching Teaching
No Book tive Aid Methodology
Code Hours (If any)

Allocation Methods R3 572-576

-
Free Space 576-580
Management

UNIT-IV
25. Security Goals T2 4-6 1 28 BB -
R4 1-10
Trust and Threat T2 6,7
Model
26. Access Control T2 9-11 1 29 PPT+BB -
Fundamentals R4 55,56
Protection System
Reference Monitor T2 11-14
R1 163
27. Secure Operating T2 16-18 1 30 PPT+BB -
System Definition R4 2-7
Assessment Criteria T2 19-20
28. Information Flow T2 57-59 1 31 PPT+BB -
Information Flow
Secrecy Models
29. Denning’s Lattice T2 60-61 2 33 BB -
Model
Bell LaPadula Model T2 62-64
R1 150-154
30. Information Flow T2 64-66 1 34 BB -
Integrity Models
Biba Integrity Model
31. Low-Water Mark T2 67-68 1 36 BB
Integrity

Clark-Wilson 68-69 1 -
integrity

UNIT-V
32. UNIX Security T2 41 2 38 BB -
UNIX Protection 41,42
System
33. UNIX Authorization T2 43-45 1 40 BB -
UNIX Security 45-47 1
Analysis
UNIX Vulnerabilities 47-49
34. Windows Security T2 49,51 1 42 PPT+BB Think Pair
Windows Protection Share
System

6
Sl. Topic Covered Ref. Page No Hours Cumula Teaching Teaching
No Book tive Aid Methodology
Code Hours (If any)

35. Windows T2 51-53 1 43 BB -

Authorization
Windows Security T2 53-55
Analysis R3 686-690
Windows T2 55,56 1
Vulnerabilities
36. Address Space Web NA 1 44 -
Layout material
Randomizations
37. Retrofitting Security T2 91-93 1 45 BB
into a Commercial
Operating System
Introduction to R1 35-37 -
Security Kernels

Content Beyond Syllabus

38. MAC OS Web NA 1 46 PPT+BB -
material

PLAN OF DELIEVERY-LAB EXPERIMENTS

7
 Number
Cumulat
Sl. of
List of Experiments ive Requirement
No periods
periods
planned

1. Illustrate the Basics UNIX commands 2 2 UNIX OS

Write programs using the following system
calls of UNIX operating system
2. 2 4 UNIX OS
fork, exec, getpid, exit, wait, close, stat,
opendir, readdir
Write C programs to implement the various Windows10/
3. CPU Scheduling Algorithms 4 8 Dev C++
a.FCFS b.SJF C.Round Robin
Write a C program to implement Semaphores Windows10/
4. 2 10
Dev C++
Write a C program to implement Shared Windows10/
5. 2 12
Memory Dev C++
Write a C program to implement Bankers Windows10/
6. Algorithm for Deadlock Detection 2 14 Dev C++
&Avoidance
Write a C program to implement the
following Memory Allocation Methods for
fixed partition Windows10/
7. 4 18
a) First Fit Dev C++
b) Worst Fit
c) Best Fit
Write a C program to implement Page Windows10/
8. Replacement Algorithms 4 22 Dev C++
a) FIFO b) LRU c)LFU
Write a C Program to demonstrate the Windows10/
9. working of Bell LaPadula Model and Biba 2 24 Dev C++
Integrity Model
Setting up access control lists of files and Linux OS
10. directories and testing the lists in Linux 2 26

Learn to enable and disable address space Linux OS

11. 4 30
layout randomization

ASSESSMENT PLAN

ASSESSMENT SCHEDULE-TEST
8
 TEST DATE
TEST PORTION FOR TEST
NO. PLANNED CONDUCTED
Internal I Unit I,II
Assessment
II Unit III,IV
Test
I Unit I
ClassTest
II Unit III

ASSESSMENT SCHEDULE-ASSIGNMENT

Group Date of Submission

Assignment No Mode
/Common/Individual
I Seminar Individual
II Written Group

ASSESSMENT SCHEDULE-LABORATORY

DATE
PLANNED (HAS TO BE
MODEL TEST PORTION FOR TEST FILLED WITH RESPECT
CONDUCTED
TO THE ACADEMIC
CALENDAR)
I All Experiments

ASSESSTMENT PATTERN

ITEM WEIGHTAGE
Continuous Assessment-I 40
Internal Assessment Test – I 60
50%
Observation + Record 50
Model Lab 50
End Semester Examination

50%
Theory + Practical 100 + 100
(Theory 35% + Practical 15% )