Operating Systems PCCST403 Scheme and Syllabus
OPERATING SYSTEMS
(Common to CS/CD/CM/CR/CA/AD/AI/CB/CN/CC/CU/CI/CG)
|
Course Code |
PCCST403 |
CIEMarks |
40 |
|
Teaching Hours/Week (L: T:P: R) |
3:1:0:0 |
ESEMarks |
60 |
|
Credits |
4 |
ExamHours |
2Hrs.30Min. |
|
Pre requisites(if any) |
None |
CourseType |
Theory |
Course Objectives:
2. To impart to the students, a practical understanding of OS implementation nuances based on the Linux operating system.
1.
SYLLABUS
|
Module
No. |
Syllabus Description |
Contact Hours |
|
1 |
Introduction
to Operating Systems(Book 1 Ch 2 introductory part),
Operating System Services (Book 3 Ch 2) Overview of Operating Systems and
Kernels, Linux Versus Classic Unix Kernels (Book 2 Ch 1) Process concepts: Process Creation,Process States,Data Structures,Process
API(Book 1 Ch 4,5), Sharing processor among processes -user and kernel
modes,context switching(Book1Ch6),System boot sequence(Book3Ch 2) Case study: Linux kernelprocess management(Book2, Ch3) Casestudy:TheLinuxImplementationofThreads(Book2,Ch3) Case study:The Linux Completely Fair Scheduler (CFS) (Book 1 Ch 9, Implementation with RB treesnot required),The Linux Scheduling Implementation, |
|
|
||
|
2 |
Concurrency and Synchronization-Basic principles(Book3 Sections 6.1, 6.2), Mechanisms -
Locks: The Basic Idea, Building Spin Locks with Test- And-Set, Compare and
Swap, Using Queues: Sleeping Instead Of Spinning (Book 1 Ch 28), Semaphores -
Definition, Binary Semaphores, The Producer/Consumer (Bounded Buffer) Problem
and its solution using semaphores, Reader-Writer Locks (Book 1 Ch 31) Case study: Linux Kernel Synchronization Methods - Spin
Locks, Semaphores, Mutexes (Book 2 Ch 10) Concurrency:Deadlock and Starvation -
Deadlock Characterization, Deadlock
Prevention and Avoidance,Deadlock Detection and recovery(Book3 Ch8),Dining
Philosophers Problem and its solution (Book 1 Ch 31) |
12 |
|
3 |
Memory management-Address Space, Memory API,Address Translation - An Example, Dynamic (Hardware-based)
Relocation, Segmentation: Generalized Base/Bounds,Address translation in
segmentation, Support for Sharing (Book 1 Ch 13 to 16) Virtual memory - Paging:
Introduction, page tables and hardware support,
TLBs,Example:Accessing An Array,-TLB hits and misses,Handling TLB misses, TLB
structure, Reducing the page table size (Book 1 Ch 18 to 20) Going beyond physical memory-Swap space,
page fault and its control flow, page replacement policies, Thrashing(Book 1
Ch 21, 22) |
11 |
|
4 |
I/O system:Modern System
architecture, Programmed I/O, Interrupts, DMA, Device interaction methods,
The Device Driver (Book 1 Ch 36), Hard disk:Geometry
(Book 1 Ch 37), disk scheduling (Book 3 Section 11.2) Case study: LinuxI/Oschedulers- Elevator, CompleteFair
Queuing(Book 2 Ch 14) Files and Directories: The
File System Interface - File descriptor, reading
and writing files(sequential and random access),Removing files-Hardlinks and
Symbolic links, Creating, reading and deleting directories, Permission bits
and Access Control Lists, Mounting a file system(Book 1 Ch 39) |
10 |
|
|
FileOrganization:The
Inode, TheMulti-Level Index(Book 1 Ch 40) |
|
Course Assessment Method
(CIE: 40 marks, ESE: 60 marks)
ContinuousInternalEvaluationMarks(CIE):
|
Attendance |
Assignment/ Microproject |
Internal Examination-1
(Written) |
Internal Examination-2 (Written ) |
Total |
|
5 |
15 |
10 |
10 |
40 |
End SemesterExamination Marks(ESE)
In PartA,all questions need to be answered and in
PartB,each student can choose anyone full question out of two questions
|
PartA |
PartB |
Total |
|
● 2 Questions from each module. ● Total of 8 Questions,each carrying 3 marks (8x3=24marks) |
● Each question carries 9marks. ● Two questions will be given from each module,out of which 1
question should be answered. ● Each question can havea maximum of 3sub- divisions. (4x9=36marks) |
60 |
Course Outcomes(COs)
At the end of the course students should be able to:
|
Course Outcome |
Bloom’s Knowledge Level(KL) |
|
|
CO1 |
Apply the concepts of process management and process scheduling mechanisms employed in operating systems. |
K3 |
|
CO2 |
Choose various process synchronization mechanisms employed in operating systems. |
K3 |
|
CO3 |
Use deadlock prevention and avoidance mechanisms in operating systems. |
K3 |
|
CO4 |
Select various memory management techniques in operating systems |
K3 |
|
CO5 |
Understand the storage management in operating systems |
K2 |
Note:K1-Remember,K2-Understand,K3-Apply,K4-Analyse,K5-Evaluate,K6-Create
CO-PO Mapping Table(Mapping of Course Outcomes to Program Outcomes)
|
|
PO1 |
PO2 |
PO3 |
PO4 |
PO5 |
PO6 |
PO7 |
PO8 |
PO9 |
PO10 |
PO11 |
PO12 |
|
CO1 |
3 |
3 |
3 |
|
|
|
|
|
|
|
|
3 |
|
CO2 |
3 |
3 |
3 |
|
|
|
|
|
|
|
|
3 |
|
CO3 |
3 |
3 |
3 |
|
|
|
|
|
|
|
|
3 |
|
CO4 |
3 |
3 |
3 |
|
|
|
|
|
|
|
|
3 |
|
CO5 |
3 |
3 |
3 |
|
|
|
|
|
|
|
|
3 |
Note:1:Slight(Low),2:Moderate(Medium),3:Substantial(High),-:NoCorrelation
|
Text Books |
||||
|
Sl.No |
Title of the Book |
Name of the Author/s |
Name of the Publisher |
Edition and Year |
|
1 |
OperatingSystems:ThreeEasy Pieces |
AndreaArpaci-Dusseau, Remzi Arpaci-Dusseau |
CreateSpace |
1/e,2018 |
|
2 |
LinuxKernelDevelopment |
RobertLove |
Pearson |
3/e,2018 |
|
3 |
OperatingSystemConcepts |
AbrahamSilberschatz,Peter B.Galvin,GregGagne |
Wiley |
10/e,2018 |
|
Reference Books |
||||
|
Sl.No |
Title of the Book |
Name of the Author/s |
Name of the Publisher |
Edition and Year |
|
1 |
Modern Operating Systems |
Andrew S.Tanenbaum
Herbert Bos |
Pearson |
5/e, 2012 |
|
2 |
The Design of the UNIX OperatingSystem |
MauriceJ.Bach |
PrenticeHallofIndia |
1/e,1994 |
|
3 |
TheLittleBookofSemaphores |
AllenB.Downey |
GreenTeaPress |
1/e,2016 |
|
Video Links(NPTEL,SWAYAM…) |
|
|
No. |
LinkID |
|
1 |
https://archive.nptel.ac.in/courses/106/105/106105214/ |
|
2 |
https://www.youtube.com/playlist?list=PLDW872573QAb4bj0URobvQTD41IV6gRkx |
Comments
Post a Comment