Escolar Documentos
Profissional Documentos
Cultura Documentos
Course Code Course Title Course Planner Lectures Tutorials Practicals Credits
CSE316 OPERATING SYSTEMS 15359::Baljit Singh Saini 3.0 0.0 0.0 3.0
Course Category Courses with conceptual focus
TextBooks
Sr No Title Author Edition Year Publisher Name
T-1 Operating System Concepts Abraham Silberschatz, 8th 2009 Wiley India Pvt Ltd
Galvin
Reference Books
Sr No Title Author Edition Year Publisher Name
R-1 Operating Systems Internals and WilliamStallings 5th 2000 Prentice Hall
Design Principles
R-2 Operating Systems D.M.Dhardhere 2nd 2006 Tata McGraw Hill
R-3 Advanced Programming in the UNIX W.Richard Stevens and 2nd 2011 Pearson
Environment Stephen A. Rago
R-4 Modern Operating System Andrew S. Tanenbaum 3rd 2005 PHI (Pretice Hall India)
R-5 UNIX System Programming Using C Terrence Chan 1st 2009 PHI (Pretice Hall India)
++,
Other Reading
Introduction to OS concepts R-3:Chapter 2 2.1 2.2 RW-5 Teaching about UNIX Difference of UNIX Discussion
(Introduction - UNIX and ANSI RW-6 and ANSI standards and ANSI standards
standards) RW-7
Week 2 Lecture 4 Process Management(Process and T-1:Chapter 3 3.1 To introduce the notion Basics of a process Discussion
threads) of a process
Process Management(Process T-1:Chapter 3 3.1 Introduction to different How moving a thread Discussion
states) states that a thread goes from one state to
through another effects it and its
children
Lecture 5 Process Management(Process T-1:Chapter 3 3.1 To teach how process is Student learns about Discussion
control box) stored in memory different attributes of a
process
Process Management(Process T-1:Chapter 3 3.2 To introduce the concept Student learns Discussion
scheduling) of scheduling parameters upon which
scheduling is done
Lecture 6 Process Management(Operations T-1:Chapter 3 3.3 To describe the various Student can create Demonstration
on processes) features of processes, processes and see how
creation, termination and they communicate
communication
Week 3 Lecture 7 Process Management(Threads) T-1:Chapter 4 4.1 4.2 To introduce the notion Know how threads are Demonstration
of a thread useful
Week 4 Lecture 10 CPU Scheduling(Scheduling T-1:Chapter 5 5.3 To describe various CPU Student learns which Discussion
algorithms - process management scheduling algorithms in scheduling algorithm is
in UNIX) lecture 10 best
Revision in Lecture 11 of
topics covered till lecture
10
Lecture 11 CPU Scheduling(Scheduling T-1:Chapter 5 5.3 To describe various CPU Student learns which Discussion
algorithms - process management scheduling algorithms in scheduling algorithm is
in UNIX) lecture 10 best
Revision in Lecture 11 of
topics covered till lecture
10
Lecture 12 Process Synchronization T-1:Chapter 3 3.4 To describe about Learns about concurrent Discussion
(Concurrent processes) concurrent processes processes
Process Synchronization(Co- T-1:Chapter 3 3.4 To describe about co Learns about difference Discussion
operating processes) operating processes in co operating and
concurrent processes
Process Synchronization RW-13 To describe the use of Learns how precedence Discussion
(Precedence graph) precedence graph graph is helpful
Process Synchronization(Hierarchy T-1:Chapter 3 3.3 To describe levels of Learns about hierarchy Discussion
of processes) processes of processes
Week 5 Lecture 13 Process Synchronization(Critical T-1:Chapter 6 6.1 6.2 To introduce the Student learns why Discussion
section problem - Two process criticalsection problem, synchronization among
solution) whose solutions can be processes is crucial
used to ensure the
consistency of data
Process Synchronization T-1:Chapter 6 6.4 To present hardware Learns how to handle Discussion
(Synchronization hardware) solutions of the critical critical section
section problem
Week 5 Lecture 14 Process Synchronization T-1:Chapter 6 6.5 To present both software Learns how to handle Discussion
(Semaphores) and hardware solutions critical section
of the critical section
problem
Process Synchronization(Monitors) T-1:Chapter 6 6.7 To present both software Learns how to handle Discussion
and hardware solutions critical section
of the critical section
problem
Lecture 15 UNIX processes(Command line R-3:Chapter 7 7.4 To demonstrate how to Learning how to Demonstration
arguments) take input from user develop programs that
take input when
program is run at
command line
UNIX processes(Shared libraries) R-3:Chapter 7 7.7 To describe how to use Learns the importance Demonstration
shared libraries and use of shared
libraries
Week 6 Lecture 16 Term Paper,Quiz,Test 1
Lecture 17 UNIX processes(Memory R-3:Chapter 7 7.8 To show how to manage Student can handle Demonstration
allocation) memory memory according to
need
UNIX processes(Environmental R-3:Chapter 7 7.9 To teach how to make Learning the use of Demonstration
variables) use of environment environment variables
variables
Lecture 18 UNIX processes(setjmp and R-3:Chapter 7 7.10 To teach how to make Learning the use of Demonstration
longjmp) use of setjmp and setjmp and longjmp
longjmp variables variables
UNIX processes(getrlimit and R-3:Chapter 7 7.11 To teach how to make Learning the use of Demonstration
setrlimit functions) use of getrlimit and getrlimit and setrlimit
setrlimit variables variables
Week 7 Lecture 19 UNIX processes(Environment list) R-3:Chapter 7 7.5 To teach how to make Learning the use of Demonstration
use of environment list environment list
UNIX processes(Memory layout of R-3:Chapter 7 7.6 To teach how memory is Learns about memory Demonstration
a C program) used by a C program usage by a program
UNIX processes(Main function) R-3:Chapter 7 7.2 To teach about the main Learns about the main Demonstration
function function
Lecture 20 UNIX processes(Process R-3:Chapter 7 7.3 To teach how to end Learns to kill processes Demonstration
termination) processes
UNIX processes(UNIX kernel R-3:Chapter 7 7.1 To teach the basics of Learning basics of a Discussion
support for processes) process process
Week 7 Lecture 20 UNIX processes(Process control) R-3:Chapter 8 8.1 8.2 To describe how to Learns to control Discussion
handle processes in processes
lecture 20
Revision in Lecture 21 of
all topics covered
Lecture 21 UNIX processes(Process control) R-3:Chapter 8 8.1 8.2 To describe how to Learns to control Discussion
handle processes in processes
lecture 20
Revision in Lecture 21 of
all topics covered
MID-TERM
Week 8 Lecture 22 Deadlock(Detection) T-1:Chapter 7 7.1 7.2 To develop a description Learn basics of Discussion
7.6 of deadlocks deadlock
Lecture 23 Deadlock(Handling) T-1:Chapter 7 7.3 To develop a description Learn how to handle Discussion
of deadlocks deadlock
Lecture 24 Deadlock(Avoidance) T-1:Chapter 7 7.5 To present a number of Student learns how to Discussion
different methods for prevent deadlock from
preventing and avoiding happening
deadlock
Week 9 Lecture 25 Deadlock(Recovery) T-1:Chapter 7 7.7 To present different Know how to deal with Discussion
methods for deadlock deadlock if it all
detection and recovery happens
Deadlock(Starvation) T-1:Chapter 7 7.7 To present different Know how to deal with Discussion
methods for deadlock deadlock if it all
detection and recovery happens
Deadlock(Critical regions) T-1:Chapter 7 7.7 To present different Know how to deal with Discussion
methods for deadlock deadlock if it all
detection and recovery happens
Lecture 26 Information management(Files and T-1:Chapter 10 10.1 To explain the function Student will learn the Discussion
directories) 10.2 of file systems basics of file system
Lecture 27 Information management T-1:Chapter 10 10.3 To describe the Student learns how files Discussion
(Directory structure) interfaces to file systems are created and
managed
Week 9 Lecture 27 Information management T-1:Chapter 11 11.3 To describe how Learns to handle Discussion
(Directory implementation - linear 11.4 directory can be directories
list and hash table) implemented
Week 10 Lecture 28 Device management(Dedicated, T-1:Chapter 13 13.3 RW-10 Describe the physical Understanding of how Discussion
shared and virtual devices) 13.3.1 structure of secondary data is read and written
storage devices on disk
Device management(Serial access RW-10 Describe the physical Understanding of how Discussion
and direct access devices) structure of secondary data is read and written
storage devices on disk
Lecture 29 Device management(Direct Access RW-10 To study the various disk Understand various Discussion
Storage Devices Channels and read techniques methods of reading data
Control Units) from disk
Device management(Disk T-1:Chapter 12 12.4 To study the various disk Understand various Discussion
scheduling methods) read techniques in methods of reading data
lecture 29 from disk
Revision in Lecture 30 of
topics covered till lecture
29
Lecture 30 Device management(Disk T-1:Chapter 12 12.4 To study the various disk Understand various Discussion
scheduling methods) read techniques in methods of reading data
lecture 29 from disk
Revision in Lecture 30 of
topics covered till lecture
29
Device management(Direct Access RW-10 To study the various disk Understand various Discussion
Storage Devices Channels and read techniques methods of reading data
Control Units) from disk
Week 11 Lecture 31 Memory Management(Objectives T-1:Chapter 8 8.1 8.3 To provide a detailed Will learn how memory Discussion
and functions) description of various is allocated
ways of organizing
memory
Memory Management(Simple RW-11 To provide a detailed Will learn how memory Discussion
resident monitor program) RW-12 description of various is allocated
ways of organizing
memory
Lecture 32 Memory Management(Overlays - T-1:Chapter 8 8.2 To provide a detailed Will learn how memory Discussion
swapping) description of various is allocated
ways of organizing
memory
Week 11 Lecture 32 Memory Management(Schemes - T-1:Chapter 8 8.4 To explain the concepts Know how page Discussion
Paging - simple and multi level) of demand paging, page replacement helps to
replacement algorithms, increase virtual memory
Lecture 33 Memory Management T-1:Chapter 8 8.3.3 To discuss how memory Learns how to Discussion
(Fragmentation - internal and wastage can be reduced optimally assign
external) memory to processes
Memory Management(Virtual T-1:Chapter 9 9.1 To describe the benefits Student learns how to Discussion
memory concept) of a virtual memory increase memory
system virtually
Week 12 Lecture 34 Memory Management(Demand T-1:Chapter 9 9.2 To describe the benefits Student learns how to Discussion
paging) of a demand paging increase memory
virtually
Memory Management(Page T-1:Chapter 9 9.4 To describe the reason of Student learns how to Discussion
interrupt fault) page replacement minimize page faults
Lecture 35 Memory Management(Page T-1:Chapter 9 9.4 To understand various Learn the page Discussion
replacement algorithms) page replacement replacement techniques
algorithms
Lecture 36 Memory Management T-1:Chapter 8 8.6 To discuss how memory Learns how to Discussion
(Segmentation - simple, multi- wastage can be reduced optimally assign
level and with paging) memory to processes
Memory Management(Memory T-1:Chapter 8 To provide a detailed Will learn how memory Discussion
management in UNIX) description of various is allocated
ways of organizing in UNIX
memory in UNIX
SPILL OVER
Week 15 Lecture 43 Spill Over
Lecture 44 Spill Over
Lecture 45 Spill Over
Total :- 10 20
Details of Academic Task(s)
AT No. Objective Topic of the Academic Task Nature of Academic Task Evaluation Mode Allottment /
(group/individuals/field submission Week
work
Term Paper 1 To enrich learning Student to do in-depth study about the allotted topic Group The term paper 3 / 13
and encourage should be
individual pedagogical in
initiatives. nature, explaining
or illustrating a
certain aspect of
topic assigned.
Test 1 To check the Test will be conducted of syllabus covered till 5th week Individual Based on answers 4/6
conceptual written
understanding of
students
Quiz 1 To prepare students Quiz will be conducted of syllabus covered till week 10th week Individual Answers submitted 9 / 11
for placement
activities
List of suggested topics for term paper[at least 15] (Student to spend about 15 hrs on any one specified term paper)