Lovely Professional University, Punjab

Course Code Course Title Lectures Tutorials Practicals Credits Course Planner
CSE316 OPERATING SYSTEMS 3 0 0 3 27289::Dr. Allam Mohan
Course Weightage ATT: 5 CA: 25 MTT: 20 ETT: 50
Course Focus EMPLOYABILITY

Course Outcomes :Through this course students should be able to

CO1 :: understand the role, functionality and layering of the system software components.
CO2 :: use system calls for managing processes, memory and the file system.
CO3 :: Analyze important algorithms eg. process scheduling and memory management algorithms
CO4 :: use and outline the various security measures that ensure threat free operation of a system
CO5 :: apply various operations on processes, threads and analyze methods to synchronize their execution
CO6 :: simulate inter-process communication techniques like message passing and shared memory

TextBooks ( T )
Sr No Title Author Publisher Name
T-1 OPERATING SYSTEM CONCEPTS ABRAHAM WILEY
SILBERSCHATZ, PETER
B. GALVIN, GERG
GAGNE
Reference Books ( R )
Sr No Title Author Publisher Name
R-1 DESIGN OF THE UNIX MAURICE J. BACH Pearson Education India
OPERATING SYSTEM
R-2 REAL-TIME SYSTEMS JANE W. S. LIU Pearson Education India

Other Reading ( OR )

Sr No Journals articles as Compulsary reading (specific articles, complete reference)

OR-1 https://www.udacity.com/course/introduction-to-operating-systems--ud923 ,
OR-2 The Linux scheduler: a decade of wasted cores:: https://dl.acm.org/doi/10.1145/2901318.2901326 ,
OR-3 Persistent Memcached: Bringing Legacy Code to Byte-Addressable Persistent Memory::
https://www.usenix.org/system/files/conference/hotstorage17/hotstorage17-paper-marathe-060717.pdf ,

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
 OR-4 All File Systems Are Not Created Equal:: https://research.cs.wisc.edu/adsl/Publications/alice-osdi14.pdf ,
OR-5 The Evolution of the Unix Time-sharing System:: http://www.read.seas.harvard.edu/~kohler/class/aosref/ritchie84evolution.pdf ,
OR-6 Disk and File System Analysis:: https://booksite.elsevier.com/samplechapters/9781597495868/Chapter_3.pdf ,
OR-7 https://dextutor.com/courses/operating-systems/ ,

Relevant Websites ( RW )
Sr No (Web address) (only if relevant to the course) Salient Features
RW-1 https://nptel.ac.in/courses/106106144 Introduction to Operating Systems, IIT Madras

RW-2 https://nptel.ac.in/courses/106108101 Introduction to Operating System

RW-3 https://nptel.ac.in/courses/106102132 Operating Systems, IIT Delhi

RW-4 https://www.cs.miami.edu/home/geoff/Courses/CSC521-04F/Content/ Operating Systems: Course Content

RW-5 https://www.udacity.com/course/introduction-to-operating-systems--ud923 Introduction to Operating Systems

RW-6 https://learn.saylor.org/course/view.php?id=94 Operating Systems

LTP week distribution: (LTP Weeks)

Weeks before MTE 7
Weeks After MTE 7
Spill Over (Lecture) 7

Detailed Plan For Lectures

Week Lecture Broad Topic(Sub Topic) Chapters/Sections of Other Readings, Lecture Description Learning Outcomes Pedagogical Tool Live Examples
Number Number Text/reference Relevant Websites, Demonstration/
books Audio Visual Aids, Case Study /
software and Virtual Images /
Labs animation / ppt
etc. Planned
Week 1 Lecture 1 Introduction to Operating T-1 RW-1 Discuss Lecture #0 to Student will come to Peer to peer Linux/Unix/Win
System(Operating System RW-2 give general idea of know how operating discussion dows
Meaning) RW-3 operating system and its system came into
working existence and how
they have evolved
over time and its
functions

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 1 Lecture 1 Introduction to Operating T-1 RW-1 Discuss Lecture #0 to Student will come to Peer to peer Linux/Unix/Win
System(Supervisor & User RW-2 give general idea of know how operating discussion dows
Mode) RW-3 operating system and its system came into
working existence and how
they have evolved
over time and its
functions
Introduction to Operating T-1 RW-1 Discuss Lecture #0 to Student will come to Peer to peer Linux/Unix/Win
System(introduction to RW-2 give general idea of know how operating discussion dows
popular operating systems RW-3 operating system and its system came into
like UNIX, Windows, etc.) working existence and how
they have evolved
over time and its
functions
Introduction to Operating T-1 RW-1 Discuss Lecture #0 to Student will come to Peer to peer Linux/Unix/Win
System(OS structure) RW-2 give general idea of know how operating discussion dows
RW-3 operating system and its system came into
working existence and how
they have evolved
over time and its
functions
Introduction to Operating T-1 RW-1 Discuss Lecture #0 to Student will come to Peer to peer Linux/Unix/Win
System(functions of OS) RW-2 give general idea of know how operating discussion dows
RW-3 operating system and its system came into
working existence and how
they have evolved
over time and its
functions
Lecture 2 Introduction to Operating T-1 To teach students The students will get Peer to peer
System(review of computer the structure of a to know various discussion.
organization) computer system, its components of a
components and computer system and
working their functioning.
shell
Lecture 3 Introduction to Operating T-1 OR-1 To teach about the Students will learn Peer to peer
System(system calls) OR-5 evolution of operating about the evolution of discussing and live
systems and operating systems demonstration.
various system calls and various system
calls.
Introduction to Operating T-1 OR-1 To teach about the Students will learn Peer to peer
System(evolution of OSs) OR-5 evolution of operating about the evolution of discussing and live
systems and operating systems demonstration.
various system calls and various system
calls.

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 2 Lecture 4 Process Management(PCB, T-1 OR-2 To teach fundamentals Students will learn Peer to peer
Operations on Processes) R-1 RW-4 of process in Unix or the fundamentals of discussion.
RW-5 Linux environment. process and PCB.
RW-6

Process Management T-1 OR-2 To teach fundamentals Students will learn Peer to peer
(Process states) R-1 RW-4 of process in Unix or the fundamentals of discussion.
RW-5 Linux environment. process and PCB.
RW-6

Process Management T-1 OR-2 To teach fundamentals Students will learn Peer to peer
(Process concept) R-1 RW-4 of process in Unix or the fundamentals of discussion.
RW-5 Linux environment. process and PCB.
RW-6

Process Management(Life T-1 OR-2 To teach fundamentals Students will learn Peer to peer
cycle) R-1 RW-4 of process in Unix or the fundamentals of discussion.
RW-5 Linux environment. process and PCB.
RW-6

Lecture 5 Process Management T-1 To teach the students The students will get Peer to peer
(Operations on processes) R-1 various operations on to know various discussion.
processes and process operations on
management. processes and process
management.
Process Management T-1 To teach the students The students will get Peer to peer
(Process management in R-1 various operations on to know various discussion.
UNIX) processes and process operations on
management. processes and process
management.
Lecture 6 Process Management(Co- T-1 RW-1 To describe the The students will Peer to peer
operating and Independent RW-2 fundamental of Inter- learn Inter-process discussion, live
Processes) RW-3 process communication communication and demonstration.
and threads concepts threads concepts
Process Management(Inter- T-1 RW-1 To describe the The students will Peer to peer
Process Communication) RW-2 fundamental of Inter- learn Inter-process discussion, live
RW-3 process communication communication and demonstration.
and threads concepts threads concepts
Process Management T-1 RW-1 To describe the The students will Peer to peer
(Process and threads) RW-2 fundamental of Inter- learn Inter-process discussion, live
RW-3 process communication communication and demonstration.
and threads concepts threads concepts
Week 3 Lecture 7 CPU Scheduling(Types of T-1 RW-1 In this lecture The students will Peer to peer
Scheduling) R-2 RW-2 fundamentals of CPU learn the basics of discussion
RW-3 scheduling and it's types CPU scheduling and
RW-5 will be discussed. it's types.

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 3 Lecture 7 CPU Scheduling(CPU T-1 RW-1 In this lecture The students will Peer to peer
scheduler - preemptive and R-2 RW-2 fundamentals of CPU learn the basics of discussion
non preemptive) RW-3 scheduling and it's types CPU scheduling and
RW-5 will be discussed. it's types.

Lecture 8 CPU Scheduling(Scheduling T-1 In this lecture various The students will Peer to peer
Algorithms) scheduling criteria, learn various discussion and
dispatcher and FCFS scheduling criteria, learning by
algorithm will be dispatcher, and FCFS problem solving.
discusses. scheduling algorithm.
CPU Scheduling(Scheduling T-1 In this lecture various The students will Peer to peer
criteria) scheduling criteria, learn various discussion and
dispatcher and FCFS scheduling criteria, learning by
algorithm will be dispatcher, and FCFS problem solving.
discusses. scheduling algorithm.
CPU Scheduling T-1 In this lecture various The students will Peer to peer
(Dispatcher) scheduling criteria, learn various discussion and
dispatcher and FCFS scheduling criteria, learning by
algorithm will be dispatcher, and FCFS problem solving.
discusses. scheduling algorithm.
CPU Scheduling(First come T-1 In this lecture various The students will Peer to peer
first serve) scheduling criteria, learn various discussion and
dispatcher and FCFS scheduling criteria, learning by
algorithm will be dispatcher, and FCFS problem solving.
discusses. scheduling algorithm.
Lecture 9 CPU Scheduling(Shortest T-1 In this lecture shortest The students will Learning by
job first) job first and Round learn SJF and Round problem solving.
Robin scheduling will Robin scheduling.
be discussed.
CPU Scheduling(Round T-1 In this lecture shortest The students will Learning by
robin) job first and Round learn SJF and Round problem solving.
Robin scheduling will Robin scheduling.
be discussed.
Week 4 Lecture 10 CPU Scheduling(Priority) T-1 In this lecture priority The student will learn Peer to peer
scheduling and multi- priority scheduling discussing and
level feedback queue and multi-level learning by
will be discussed. feedback queue will problem solving.
be discussed.
CPU Scheduling(Multi level T-1 In this lecture priority The student will learn Peer to peer
feedback queue) scheduling and multi- priority scheduling discussing and
level feedback queue and multi-level learning by
will be discussed. feedback queue will problem solving.
be discussed.

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 4 Lecture 11 CPU Scheduling T-1 In this lecture The students will Peer to peer
(multiprocessor scheduling, multiprocessor learn multiprocessor discussion and
real time scheduling) scheduling, real time scheduling, real time learning by
scheduling and thread scheduling and thread problem solving.
scheduling will be scheduling.
discussed.

CPU Scheduling(thread T-1 In this lecture The students will Peer to peer
scheduling) multiprocessor learn multiprocessor discussion and
scheduling, real time scheduling, real time learning by
scheduling and thread scheduling and thread problem solving.
scheduling will be scheduling.
discussed.

Lecture 12 Process Synchronization T-1 In this lecture co- The student will get Peer to peer
(Critical Section Problem) operating processes will to know about co- discussion
be introduced and operating processes
fundamental of critical and critical section
section problem will be problem.
discussed
Process Synchronization T-1 In this lecture co- The student will get Peer to peer
(Co-operating processes) operating processes will to know about co- discussion
be introduced and operating processes
fundamental of critical and critical section
section problem will be problem.
discussed
Week 5 Lecture 13 Process Synchronization T-1 In this lecture the The students will get peer to peer
(Concurrent processes) teacher will discuss the to know about discussion and live
notion of concurrent concurrent processes demonstration
processes and process and process using Linux.
hierarchy. Teacher can heirarchy.
discuss fork-join and
cobegin-coend construct
of concurrent
processing.
Process Synchronization T-1 In this lecture the The students will get peer to peer
(Hierarchy of processes) teacher will discuss the to know about discussion and live
notion of concurrent concurrent processes demonstration
processes and process and process using Linux.
hierarchy. Teacher can heirarchy.
discuss fork-join and
cobegin-coend construct
of concurrent
processing.

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 5 Lecture 14 Process Synchronization T-1 In this lecture The student will learn Peer to peer
(Semaphores) precedence graphs and creation of discussion/
synchronization precedence graphs learning by
primitives' like and uses of problem solving
semaphore mutex will synchronization /live demonstration
be discussed. constructs.
Process Synchronization T-1 In this lecture The student will learn Peer to peer
(Precedence graph) precedence graphs and creation of discussion/
synchronization precedence graphs learning by
primitives' like and uses of problem solving
semaphore mutex will synchronization /live demonstration
be discussed. constructs.
Lecture 15 Process Synchronization T-1 In this lecture classical The student will get Peer to peer
(Producer consumer synchronization to know about discussion.
problem) problems will be classical
discussed. synchronization
problem like
producer-consumer
problem.
Process Synchronization T-1 In this lecture classical The student will get Peer to peer
(classical two process and n- synchronization to know about discussion.
process solutions) problems will be classical
discussed. synchronization
problem like
producer-consumer
problem.
Week 6 Lecture 16 Test 1
Lecture 17 Process Synchronization T-1 In this lecture Dining The students will Peer to peer
(Monitors) Philosophers problem, learn about Dining discussion and
and reader-writer Philosopher Problem learning by
problem will be and Reader-writer problem solving.
discussed along with Problem and their
monitors and hardware probable solutions
primitives for using hardware
synchronization. primitives.
Process Synchronization T-1 In this lecture Dining The students will Peer to peer
(Dining Philosopher Philosophers problem, learn about Dining discussion and
Problem) and reader-writer Philosopher Problem learning by
problem will be and Reader-writer problem solving.
discussed along with Problem and their
monitors and hardware probable solutions
primitives for using hardware
synchronization. primitives.

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 6 Lecture 17 Process Synchronization T-1 In this lecture Dining The students will Peer to peer
(Reader-writer Problem) Philosophers problem, learn about Dining discussion and
and reader-writer Philosopher Problem learning by
problem will be and Reader-writer problem solving.
discussed along with Problem and their
monitors and hardware probable solutions
primitives for using hardware
synchronization. primitives.
Process Synchronization T-1 In this lecture Dining The students will Peer to peer
(hardware primitives for Philosophers problem, learn about Dining discussion and
synchronization) and reader-writer Philosopher Problem learning by
problem will be and Reader-writer problem solving.
discussed along with Problem and their
monitors and hardware probable solutions
primitives for using hardware
synchronization. primitives.
Lecture 18 Threads(Overview) T-1 In this lecture Threads The students will peer to peer
concept and learn Threads discussing
multithreading models concept and
will be discussed. multithreading
models will be
discussed.
Threads(Multithreading T-1 In this lecture Threads The students will peer to peer
Models) concept and learn Threads discussing
multithreading models concept and
will be discussed. multithreading
models will be
discussed.
Week 7 Lecture 19 Threads(scheduler T-1 In this lecture few The students will Live
activations) programming examples learn creation of demonstration.
to create multithreaded multithreaded
process will be processes.
discussed.
Threads(examples of T-1 In this lecture few The students will Live
threaded programs) programming examples learn creation of demonstration.
to create multithreaded multithreaded
process will be processes.
discussed.

SPILL OVER
Week 7 Lecture 20 Spill Over
Lecture 21 Spill Over

MID-TERM

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 8 Lecture 22 Deadlock(Deadlock T-1 OR-7 In this lecture Deadlock The students will get Peer to peer
Characterization) and essential conditions to know the deadlock discussion
of deadlock occurrence and its essential
will be discussed. conditions.
Lecture 23 Deadlock(Deadlock T-1 OR-7 In this lecture deadlock The students will peer to peer
Avoidance & Detection) avoidance algorithms learn deadlock discussion and
will be discussed. avoidance will be learning by
discussed problem solving.
Lecture 24 Deadlock(Handling of T-1 In this lecture Deadlock The students will Peer to peer
deadlocks- Deadlock Prevention methods will learn Deadlock discussion.
Prevention) be discussed. Prevention methods
will be discussed.
Week 9 Lecture 25 Deadlock(Deadlock T-1 In this lecture Deadlock The students will peer to peer
Recovery) recovery will be learn various ways of discussion
discussed. Deadlock recovery.
Deadlock(Starvation) T-1 In this lecture Deadlock The students will peer to peer
recovery will be learn various ways of discussion
discussed. Deadlock recovery.
Lecture 26 Protection and Security T-1 In this lecture need of The students will get Peer to peer
(Need for Security) security and various to know about need discussion.
types of security threats of security and
will be discussed. various types of
security threats
Protection and Security T-1 In this lecture need of The students will get Peer to peer
(Security Vulnerability like security and various to know about need discussion.
Buffer overflow) types of security threats of security and
will be discussed. various types of
security threats
Protection and Security T-1 In this lecture need of The students will get Peer to peer
(Trapdoors, Backdoors, security and various to know about need discussion.
cache poisoning etc) types of security threats of security and
will be discussed. various types of
security threats
Protection and Security T-1 In this lecture need of The students will get Peer to peer
(Authentication-Password security and various to know about need discussion.
based Authentication) types of security threats of security and
will be discussed. various types of
security threats
Protection and Security T-1 In this lecture need of The students will get Peer to peer
(Password Maintenance & security and various to know about need discussion.
Secure Communication) types of security threats of security and
will be discussed. various types of
security threats

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 9 Lecture 26 Protection and Security T-1 In this lecture need of The students will get Peer to peer
(Application Security - security and various to know about need discussion.
Virus, Program Threats) types of security threats of security and
will be discussed. various types of
security threats
Lecture 27 Protection and Security T-1 Various protection The students will peer to peer
(Goals of protection) mechanism will be learn protection discussion.
discussed. mechanism.
Protection and Security T-1 Various protection The students will peer to peer
(Principles of protection) mechanism will be learn protection discussion.
discussed. mechanism.
Protection and Security T-1 Various protection The students will peer to peer
(Domain of protection) mechanism will be learn protection discussion.
discussed. mechanism.
Protection and Security T-1 Various protection The students will peer to peer
(Access matrix) mechanism will be learn protection discussion.
discussed. mechanism.
Protection and Security T-1 Various protection The students will peer to peer
(Implementation of access mechanism will be learn protection discussion.
matrix) discussed. mechanism.
Protection and Security T-1 Various protection The students will peer to peer
(System and network mechanism will be learn protection discussion.
threats) discussed. mechanism.
Protection and Security T-1 Various protection The students will peer to peer
(Examples of attacks) mechanism will be learn protection discussion.
discussed. mechanism.
Week 10 Lecture 28 Memory Management T-1 In this lecture The students will Peer to peer
(Logical & Physical Address fundamentals of learn fundamentals of discussion and
Space) memory management memory management learning by
and contiguous memory and contiguous problem solving.
allocation techniques memory allocation
will be discussed. techniques.
Memory Management T-1 In this lecture The students will Peer to peer
(Contiguous Memory fundamentals of learn fundamentals of discussion and
allocation) memory management memory management learning by
and contiguous memory and contiguous problem solving.
allocation techniques memory allocation
will be discussed. techniques.
Lecture 29 Assignment -
Simulation based
Lecture 30 Memory Management T-1 OR-7 In this lecture The students will get Peer to peer
(Paging) R-2 fundamentals of paging, to know discussion.
multi level paging and fundamentals of
segmentation will be paging, multi level
discussed. paging and
segmentation

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 10 Lecture 30 Memory Management T-1 OR-7 In this lecture The students will get Peer to peer
(Segmentation) R-2 fundamentals of paging, to know discussion.
multi level paging and fundamentals of
segmentation will be paging, multi level
discussed. paging and
segmentation
Memory Management T-1 OR-7 In this lecture The students will get Peer to peer
(Schemes - Paging - simple R-2 fundamentals of paging, to know discussion.
and multi level) multi level paging and fundamentals of
segmentation will be paging, multi level
discussed. paging and
segmentation
Week 11 Lecture 31 Memory Management T-1 In this lecture the The students will Peer to peer
(Swapping) concept of virtual learn the concept of discussing.
memory and demand virtual memory and
paging will be demand paging.
discussed.
Memory Management(Page T-1 In this lecture the The students will Peer to peer
interrupt fault) concept of virtual learn the concept of discussing.
memory and demand virtual memory and
paging will be demand paging.
discussed.
Memory Management T-1 In this lecture the The students will Peer to peer
(Overlays - swapping) concept of virtual learn the concept of discussing.
memory and demand virtual memory and
paging will be demand paging.
discussed.
Memory Management T-1 In this lecture the The students will Peer to peer
(Virtual memory concept) concept of virtual learn the concept of discussing.
memory and demand virtual memory and
paging will be demand paging.
discussed.
Lecture 32 Memory Management(Page T-1 OR-7 In this lecture simple The students will peer to peer
replacement algorithms) RW-1 and multi-level learn simple and discussion and
RW-2 segmentation along with multi-level learning by
RW-3 page replacement segmentation along problem solving
algorithms will be with page
discussed. replacement
algorithms
Memory Management T-1 OR-7 In this lecture simple The students will peer to peer
(Segmentation - simple, RW-1 and multi-level learn simple and discussion and
multi-level and with paging) RW-2 segmentation along with multi-level learning by
RW-3 page replacement segmentation along problem solving
algorithms will be with page
discussed. replacement
algorithms

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 11 Lecture 32 Memory Management T-1 OR-7 In this lecture simple The students will peer to peer
(Fragmentation - internal RW-1 and multi-level learn simple and discussion and
and external) RW-2 segmentation along with multi-level learning by
RW-3 page replacement segmentation along problem solving
algorithms will be with page
discussed. replacement
algorithms
Memory Management T-1 OR-7 In this lecture simple The students will peer to peer
(Demand paging) RW-1 and multi-level learn simple and discussion and
RW-2 segmentation along with multi-level learning by
RW-3 page replacement segmentation along problem solving
algorithms will be with page
discussed. replacement
algorithms
Lecture 33 File Management(File T-1 OR-7 In this lecture the The students will peer to peer
Concepts) RW-1 concepts of file and learn simple and discussion
RW-2 directory management multi-level
RW-3 will be discussed along segmentation along
with file sharing and with page
mounting concepts will replacement
be discussed. algorithms.
File Management(Access T-1 OR-7 In this lecture the The students will peer to peer
methods) RW-1 concepts of file and learn simple and discussion
RW-2 directory management multi-level
RW-3 will be discussed along segmentation along
with file sharing and with page
mounting concepts will replacement
be discussed. algorithms.
File Management(Directory T-1 OR-7 In this lecture the The students will peer to peer
Structure) RW-1 concepts of file and learn simple and discussion
RW-2 directory management multi-level
RW-3 will be discussed along segmentation along
with file sharing and with page
mounting concepts will replacement
be discussed. algorithms.
File Management(File T-1 OR-7 In this lecture the The students will peer to peer
System Mounting and RW-1 concepts of file and learn simple and discussion
Sharing) RW-2 directory management multi-level
RW-3 will be discussed along segmentation along
with file sharing and with page
mounting concepts will replacement
be discussed. algorithms.
File Management(Directory T-1 OR-7 In this lecture the The students will peer to peer
Implementation) RW-1 concepts of file and learn simple and discussion
RW-2 directory management multi-level
RW-3 will be discussed along segmentation along
with file sharing and with page
mounting concepts will replacement
be discussed. algorithms.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 12 Lecture 34 Test 2
Lecture 35 File Management T-1 OR-3 In this lecture file The students will Peer to peer
(Protection) OR-4 allocation methods, learn file allocation discussion and
OR-6 protection mechanisms methods, protection learning by
and free space mechanisms and free problem solving.
management schemes space management
will be discussed. schemes.
File Management(Allocation T-1 OR-3 In this lecture file The students will Peer to peer
methods) OR-4 allocation methods, learn file allocation discussion and
OR-6 protection mechanisms methods, protection learning by
and free space mechanisms and free problem solving.
management schemes space management
will be discussed. schemes.
File Management(Free- T-1 OR-3 In this lecture file The students will Peer to peer
Space Management) OR-4 allocation methods, learn file allocation discussion and
OR-6 protection mechanisms methods, protection learning by
and free space mechanisms and free problem solving.
management schemes space management
will be discussed. schemes.
Lecture 36 Device management T-1 RW-1 In this lecture different The students will Peer to peer
(Dedicated, shared and RW-2 types of devices and learn different types discussion
virtual devices) RW-3 access methods will be of devices and access
introduced methods.
Device management(Serial T-1 RW-1 In this lecture different The students will Peer to peer
access and direct access RW-2 types of devices and learn different types discussion
devices) RW-3 access methods will be of devices and access
introduced methods.
Device management(Direct T-1 RW-1 In this lecture different The students will Peer to peer
Access Storage Devices – RW-2 types of devices and learn different types discussion
Channels and Control Units) RW-3 access methods will be of devices and access
introduced methods.
Week 13 Lecture 37 Device management(Disk T-1 OR-7 In this lecture various The students will Learning by
scheduling methods) RW-1 disk scheduling learn various disk problem solving
RW-2 algorithms like FCFS, scheduling
RW-3 SSTF, SCAN, C-SCAN, algorithms like
LOOK and C-LOOK FCFS, SSTF, SCAN,
will be discussed. C-SCAN, LOOK and
C-LOOK.
Lecture 38 Inter process communication T-1 RW-1 In this lecture inter The students will get peer to peer
(Introduction to IPC (Inter RW-2 process communication to know the discussion
process communication) RW-3 concepts and semaphore importance of inter
Methods) and mutex will be process
discussed. communication and
it's implementation
techniques.

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 13 Lecture 38 Inter process communication T-1 RW-1 In this lecture inter The students will get peer to peer
(Co-processes) RW-2 process communication to know the discussion
RW-3 concepts and semaphore importance of inter
and mutex will be process
discussed. communication and
it's implementation
techniques.
Inter process communication T-1 RW-1 In this lecture inter The students will get peer to peer
(Semaphores) RW-2 process communication to know the discussion
RW-3 concepts and semaphore importance of inter
and mutex will be process
discussed. communication and
it's implementation
techniques.
Lecture 39 Inter process communication T-1 In this lecture the the students will be peer to peer
(Pipes - popen and pclose concept of pipes will be able to understand discussion and
functions) discussed. pipes and their learning by doing.
implementation.
Inter process communication T-1 In this lecture the the students will be peer to peer
(Stream pipes) concept of pipes will be able to understand discussion and
discussed. pipes and their learning by doing.
implementation.
Inter process communication T-1 In this lecture the the students will be peer to peer
(FIFOs) concept of pipes will be able to understand discussion and
discussed. pipes and their learning by doing.
implementation.
Inter process communication T-1 In this lecture the the students will be peer to peer
(Passing File descriptors) concept of pipes will be able to understand discussion and
discussed. pipes and their learning by doing.
implementation.
Week 14 Lecture 40 Inter process communication T-1 OR-7 In this lecture shared the students will learn peer to peer
(Shared memory) RW-1 memory and message shared memory and discussion and
RW-2 passing techniques will message passing learning by
RW-3 be discussed. techniques. problem solving.

Inter process communication T-1 OR-7 In this lecture shared the students will learn peer to peer
(Message queues) RW-1 memory and message shared memory and discussion and
RW-2 passing techniques will message passing learning by
RW-3 be discussed. techniques. problem solving.

SPILL OVER
Week 14 Lecture 41 Spill Over
Lecture 42 Spill Over
Week 15 Lecture 43 Spill Over
Lecture 44 Spill Over

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
 Week 15 Lecture 45 Spill Over

Scheme for CA:

CA Category of this Course Code is:C010102 (Total 3 tasks, 1 compulsory and out of remaining 1 best out of 2 to be considered)

Component Iscompulsory Weightage (%) Mapped CO(s)

Assignment - Simulation based Yes 50
Test 1 NO 50
Test 2 NO 50

Details of Academic Task(s)

Academic Task Objective Detail of Academic Task Nature of Academic Academic Task Marks Allottment /
Task Mode submission
(group/individuals) Week
Assignment - To assess the This will be a simulation based assignment. Students will be given Individual Online 30 3 / 10
Simulation based students’ logic some scenario based problems to code in C programming.
building and
programming skills.
Scenario-based
problems on
operating system
concepts will be
given to code in C
language. The
students will code
and submit the code
onli
Test 1 To assess the This will be an online/offline Quiz of 30 Questions based on Individual Online 30 5/6
students’ Introduction to Operating System, Process Management, CPU
understanding on Scheduling, and Process Synchronization.
Introduction to
Operating System,
Process
Management, CPU
Scheduling, and
Process
Synchronization

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Test 2 To assess the This will be a proctored, written test of 45 minutes based on Individual Offline 30 11 / 12
students’ Threads, Deadlock, Protection and Security, and Memory
understanding on Management.
Threads, Deadlock,
Protection and
Security, and
Memory
Management.

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.