PCTE INSTITUTE OF ENGINEERING AND TECHNOLOGY

COURSE: [Link] (CSE)

SUBJECT NAME: Operating Systems
SUBJECT CODE: BTCS 402-18
SEMESTER: 4th
CREDIT: 3
COURSE INSTRUCTOR: Ms. Ankita Gupta

EMAIL ADDRESS: ankitagupta@[Link]

OVERALL COURSE OBJECTIVES

This course provides in-depth knowledge about Operating System. It includes a detailed
discussion about different types of Operating system, scheduling algorithms, memory
management etc. Concepts that have a direct effect on the efficiency of an operating system
are also discussed.

COURSE OUTCOMES
After studying this course, the student will be able to:

1. Explain basic operating system concepts such as overall architecture, system calls, user
mode and kernel mode;

2. Distinguish concepts related to processes, threads, process scheduling, race conditions and
critical sections;

3. Analyze and apply CPU scheduling algorithms, deadlock detection and prevention
algorithms;

4. Examine and categorize various memory management techniques like caching, paging,
segmentation, virtual memory, and thrashing;

5. Design and implement file management system; &

6. Appraise high-level operating systems concepts such as file systems, disk-scheduling

algorithms and various file systems

Department of Computer Science and Engineering

PCTE INSTITUTE OF ENGINEERING AND TECHNOLOGY

SYLLABUS

Module 1: Introduction
Concept of Operating Systems, Generations of Operating systems, Types of Operating
Systems, OS Services, System Calls, Structure of an OS - Layered, Monolithic, Microkernel
Operating Systems, Concept of Virtual Machine. Case study on UNIX and WINDOWS
Operating System. [6 hrs] (CO1)
Module 2: Processes
Definition, Process Relationship, Different states of a Process, Process State transitions,
Process Control Block (PCB), Context switching
Thread: Definition, Various states, Benefits of threads, Types of threads, Concept of
multithreads,
Process Scheduling: Foundation and Scheduling objectives, Types of Schedulers,
Scheduling criteria: CPU utilization, Throughput, Turnaround Time, Waiting Time, Response
Time; Scheduling algorithms: Pre-emptive and Non-pre-emptive, FCFS, SJF, RR;
Multiprocessor scheduling: Real Time scheduling: RM and EDF.
[10 hrs] (CO2, CO3)

Module 3: Inter-process Communication

Critical Section, Race Conditions, Mutual Exclusion, Hardware Solution, StrictAlternation,
Peterson’s Solution, TheProducer\ConsumerProblem, Semaphores,EventCounters,Monitors,
Message Passing, Classical IPC Problems: Reader’s & Writer Problem, Dinning
Philosopher Problem etc.
[8 hrs] (CO2)

Module 4: Deadlocks
Definition, Necessary and sufficient conditions for Deadlock, Deadlock Prevention, Deadlock
Avoidance: Banker’s algorithm, Deadlock detection and Recovery.
[8 hrs] (CO3)

Department of Computer Science and Engineering

PCTE INSTITUTE OF ENGINEERING AND TECHNOLOGY

Module 5: MemoryManagement
Basicconcept,LogicalandPhysical address map, Memory allocation: Contiguous Memory
allocation –Fixedandvariable partition–Internaland External fragmentation and Compaction;
Paging: Principle of operation – Page allocation–Hardware support for paging, Protection and
sharing, Disadvantages of paging.
Virtual Memory: Basics of Virtual Memory – Hardware and control structures – Locality of
reference, Page fault, Working Set, Dirty page/Dirty bit – Demand paging, Page Replacement
algorithms: Optimal, First in First Out (FIFO), Second Chance (SC), Not recently used
(NRU) and Least Recently used (LRU).
[10 hrs] (CO4)

Module 6: I/O Hardware

I/O devices, Device controllers, Direct memory access Principles of I/O Software: Goals of
Interrupt handlers, Device drivers, Device independent I/O software, Secondary-Storage
Structure: Disk structure, Disk scheduling algorithms
File Management: Concept of File, Access methods, File types, File operation, Directory
structure, File System structure, Allocationmethods (contiguous, linked, indexed), Free
Space Management (bit vector, linked list, grouping), directory implementation (linear list,
hash table), efficiency and performance.
Disk Management: Disk structure, Disk scheduling - FCFS, SSTF, SCAN, C-SCAN, Disk
reliability, Disk formatting, Boot-block, Bad blocks.
[8 hrs] (CO5, CO6)

TEXT BOOKS

1. Operating System Concepts Essentials, 9th Edition by AviSilberschatz, Peter Galvin,

Greg Gagne, Wiley Asia Student Edition.

2. Operating Systems: Internals and Design Principles, 5th Edition, William Stallings,
Prentice Hall of India

Department of Computer Science and Engineering

PCTE INSTITUTE OF ENGINEERING AND TECHNOLOGY

REFERENCE BOOKS

1. Operating System: A Design-oriented Approach, 1st Edition by Charles Crowley, Irwin

Publishing
2. Operating Systems: A Modern Perspective, 2nd Edition by Gary J. Nutt, Addison-Wesley
3. Design of the Unix Operating Systems, 8th Edition by Maurice Bach, Prentice-Hall of
India
4. Understanding the Linux Kernel, 3rd Edition, Daniel P. Bovet, Marco Cesati, O'Reilly and
Associates

EVALUATION CRITERIA

Total Internal Weightage: 40 Marks

Total External Weightage: 60 Marks

PARAMETER MARKS
Mid Semester Examination 1
24
Mid Semester Examination 2
Attendance 6
Class Test/Task/Quiz 5
Presentation 5
Total 40

Note: There will be NO REMAKE of Mid-Semester Examination .Remake of Mid

Semester Examination will be held only if the genuine Medical leave is duly approved
by the Principal. The students are advised to appear in all the evaluation parameters as per
Class Calendar with preparation to avoid any inconvenience.

*It is compulsory to appear in both MSE-1 and MSE-2. The average marks in MSE-1 &
MSE-2 will be considered for Internal Evaluation.

Department of Computer Science and Engineering

PCTE INSTITUTE OF ENGINEERING AND TECHNOLOGY

Attendance Policy:

It is compulsory for all the students to have 75% attendance in each subject at the end of the
semester failing which the student will not be allowed to write the final exam.

CLASSROOM POLICIES:

1. Be punctual for the class, try to minimize disturbance if you are late. I may not
reject students who come after 5 minutes from the scheduled time but without
attendance.

2. During lecture delivery, if you have any kind of query, just raise your hand.
Queries are important for the understanding of the concepts. So, do ask queries
but make sure they are relevant to the subject.

3. Be disciplined in the classroom and don’t make any noise while we are studying.

Presentation Topics :

The students will be allocated a unique Topic for Presentation at least ten days before the
scheduled Presentation. Each student will deliver an individual presentation on any one of the
following topics :-

1. Evolution of Operating Systems in Cloud Era

2. Modern Kernel Design Trends
3. Microkernel Usage in Industry Systems
4. Hybrid Kernels in Commercial Operating Systems
5. Operating Systems for Artificial Intelligence
6. AI Assisted Operating System Management
7. Operating Systems in Data Center Infrastructure
8. Cloud Native Operating System Concepts
9. Containerization Impact on Operating Systems
10. Virtual Machines versus Containers Today

Department of Computer Science and Engineering

PCTE INSTITUTE OF ENGINEERING AND TECHNOLOGY

11. Lightweight Virtualization Technologies

12. Serverless Computing Operating System Challenges
13. Operating Systems for Distributed Cloud Platforms
14. Edge Computing Operating System Architecture
15. Operating Systems for Edge AI Devices
16. Real Time Operating Systems in Automotive Industry
17. Operating Systems for Autonomous Systems
18. Power Aware Operating System Design
19. Energy Efficient Operating Systems
20. Green Computing through Operating Systems
21. Operating Systems for High Performance Computing
22. GPU Aware Operating System Scheduling
23. Heterogeneous Computing OS Support
24. Operating Systems for Multi Core Scalability
25. Memory Optimization Techniques in Modern OS
26. Operating System Support for Persistent Memory
27. Advanced Memory Protection Techniques
28. Secure Memory Management in Operating Systems
29. Operating Systems for Big Data Platforms
30. File System Innovations in Modern OS
31. Distributed File Systems Trends
32. Secure File Systems Design
33. Operating Systems for Cyber Physical Systems
34. Kernel Level Security Enhancements
35. Secure Boot and Trusted Execution
36. Operating System Hardening Techniques
37. OS Defense Mechanisms against Malware
38. Sandboxing Applications using Operating Systems
39. Operating Systems for Secure Computing
40. Fault Tolerant Operating System Design
41. Self Healing Operating Systems
42. Reliability Engineering in Operating Systems
43. Operating Systems for Internet Infrastructure
44. Operating Systems in 5G Networks

Department of Computer Science and Engineering

PCTE INSTITUTE OF ENGINEERING AND TECHNOLOGY

45. Operating Systems for Smart Devices

46. Embedded Operating Systems Industry Trends
47. Operating Systems for Wearable Devices
48. Operating Systems for Smart Healthcare
49. Operating Systems Supporting Virtual Reality
50. Operating Systems for Augmented Reality
51. Operating Systems for Metaverse Platforms
52. Quantum Computing Operating System Challenges
53. Future Operating System Architectures
54. Bio Inspired Operating System Concepts
55. Operating Systems and Digital Twins
56. Sustainable Operating System Design
57. Cross Platform Operating System Development
58. Operating Systems in Modern Cybersecurity
59. Next Generation Operating Systems Research
60. Future Challenges in Operating System Design

COURSE PLAN

Subject: Operating System

Subject Code: BTCS 402-18

Class: [Link] (CSE)

Semester: 4th

No. of Lectures: 33

Name of Instructor: Ms. Ankita Gupta

Lec. No. Lecture Topic Content to be Covered

Department of Computer Science and Engineering

PCTE INSTITUTE OF ENGINEERING AND TECHNOLOGY

Concept of Operating Systems, Concept of Operating Systems, Generation of

1. Generation of Operating system Operating system
Types of Operating Systems Types of Operating Systems
OS Services, System Calls,
OS Services, System Calls, Structure of an OS -
2. Structure of an OS - Layered,
Layered, Monolithic, Microkernel
Monolithic, Microkernel
Concept of Virtual Machine:
Concept of Virtual Machine: Creating virtual
3. Creating virtual
machine(Discussion and Task)
machine(Discussion and Task)
Process : Definition, Process
Process : Definition, Process Relationship, Different
Relationship, Different states of a
states of a Process
Process
4. Process State transitions, Process
Process State transitions, Process Control Block
Control Block (PCB), Context
(PCB), Context switching
switching
Process Scheduling: Foundation
Process Scheduling: Foundation and Scheduling
and Scheduling objectives, Types
objectives, Types of Schedulers
of Schedulers
5. Scheduling criteria: CPU
utilization, Throughput, Scheduling criteria: CPU utilization, Throughput,
Turnaround Time, Waiting Time, Turnaround Time, Waiting Time, Response Time;
Response Time;
Scheduling algorithms: Pre-
Scheduling algorithms: Pre-emptive and Non-pre-
6. emptive and Non-pre-emptive,
emptive, FCFS, SJF
FCFS, SJF
7. RR; Multiprocessor scheduling RR; Multiprocessor scheduling
Real Time scheduling: RM and
8. Real Time scheduling: RM and EDF
EDF
Critical Section, Race Critical Section, Race Conditions, Mutual
Conditions, Mutual Exclusion Exclusion

9. Hardware Solution, Strict

Hardware Solution, Strict Alternation
Alternation
Peterson’s Solution Peterson’s Solution
The Producer\Consumer Problem The Producer\Consumer Problem

Department of Computer Science and Engineering

PCTE INSTITUTE OF ENGINEERING AND TECHNOLOGY

10. Semaphores, Event Counters Semaphores, Event Counters

11. Monitors, Message Passing Monitors, Message Passing

Classical IPC Problems: Reader’s
Classical IPC Problems: Reader’s & Writer
12. & Writer Problem, Dinning
Problem, Dinning Philosopher Problem etc
Philosopher Problem etc
Definition, Necessary and
Definition, Necessary and sufficient conditions for
13. sufficient conditions for
Deadlock
Deadlock
14. Deadlock Prevention Deadlock Prevention
Deadlock Avoidance: Banker’s
15. Deadlock Avoidance: Banker’s algorithm
algorithm
16. Deadlock detection and Recovery Deadlock detection and Recovery
Memory Management: Basic
Memory Management: Basic concept, Logical and
17. concept, Logical and Physical
Physical address map
address map
Memory allocation: Contiguous Memory allocation: Contiguous Memory
18.
Memory allocation –Fixed allocation –Fixed
Variable partition–Internal and
Variable partition–Internal and External
19. External fragmentation and
fragmentation and Compaction
Compaction
Paging: Principle of operation –
20. Paging: Principle of operation – Page allocation
Page allocation
Hardware support for paging,
Hardware support for paging, Protection and
21. Protection and sharing,
sharing, Disadvantages of paging
Disadvantages of paging
Virtual Memory: Basics of
Virtual Memory: Basics of Virtual Memory,
22. Virtual Memory, Hardware and
Hardware and control structures
control structures
Locality of reference, Page fault, Locality of reference, Page fault, Working Set,
23.
Working Set, Dirty page/Dirty bit Dirty page/Dirty bit
24. Demand paging Demand paging
Page Replacement algorithms: Page Replacement algorithms: Optimal, First in
25.
Optimal, First in First Out (FIFO) First Out (FIFO)

Department of Computer Science and Engineering

PCTE INSTITUTE OF ENGINEERING AND TECHNOLOGY

Second Chance (SC), Not

Second Chance (SC), Not recently used (NRU)
26. recently used (NRU) and Least
and Least Recently used (LRU)
Recently used (LRU)
27. I/O devices, Device controllers I/O devices, Device controllers
Direct memory access Principles Direct memory access Principles of I/O Software:
28. of I/O Software: Goals of Goals of Interrupt handlers
Interrupt handlers Device drivers, Device independent I/O software
Device drivers, Device
29. independent I/O software

Secondary-Storage Structure: Secondary-Storage Structure: Disk structure, Disk

30. Disk structure, Disk scheduling scheduling algorithms(FCFS, SSTF, SCAN, C-
algorithms(FCFS, SSTF, SCAN, SCAN, Disk reliability)
31. C-SCAN, Disk reliability)
File Management: Concept of File Management: Concept of File, Access
32. File, Access methods, File types, methods, File types, File operation, Directory
File operation, Directory structure
33. structure
File System structure, Allocation File System structure, Allocation methods
34. methods (contiguous, linked, (contiguous, linked, indexed), Free Space
indexed), Free Space Management (bit vector, linked list, grouping)
Management (bit vector, linked
35.
list, grouping)
directory implementation (linear
directory implementation (linear list, hash table),
list, hash table), efficiency and
efficiency and performance
36. performance
Disk formatting, Boot-block, Bad
Disk formatting, Boot-block, Bad blocks.
blocks.

Department of Computer Science and Engineering