Course
Course Code Name of Course L T P Credit
Type
DC CSC209 Operating System 3 0 0 9
Course Objective
The objective of the course is to present an introduction to operating system, with an emphasis information,different
concepts and functions of operating system.
Learning Outcomes
Upon successful completion of this course, students will:
have a broad understanding of operating system concepts.
it will provide the basics and fundamental knowledge of operating system.
be able to solve numerical problems with possible case studiesto understand the behavior of operating system.
be able to understand the different functions and internal operations of the operating system.
it will exploresome basics and fundamental knowledge of different types of operating system.
Uni Lect
t ure
Topics to be Covered Learning Outcome
No. Hour
s
Introduction:Introduction, Categories of Operating
Systems, Computer System Architecture, Interrupts, Understanding ofoperating system,
Storage Structure, Hardware Protection; OS Structures: different concepts and functions of
1 4
OS Components, System Calls, System Structures, Virtual operating system.
Machines, System Design Goal, SYSGEN;
Process Management: Process Concept, Process Sate, This unit will help student in
PCB, Process Scheduling, Schedulers, Process Creation, understanding the process life cycle
Process Termination, Co-operating Process, Producer and its scheduling, synchronization
Consumer Problem, Inter-process Communication, Client techniques.
2 6
Server Communication, Threads, Process
Synchronization, Critical Section Problem, Bakery
Algorithms, Semaphores, Reader’s Writer’s Problem,
Dining Philosopher’s Problem;.
CPU Scheduling: CPU Scheduler, Scheduling Criteria, This unit will help the student to
Scheduling Algorithms: FCFS, SJF, Priority Scheduling, understand the different CPU
3 Round Robin Scheduling, Multilevel Queue Scheduling, 7 scheduling criteria and its
Multilevel Feedback Queue Scheduling; techniques.
Deadlock: Introduction, Deadlock Prevention, Deadlock
Avoidance, Resource Allocation Graph Algorithms, To know all about, how programs
4 Deadlock Detection, Prevention and Recovery; 5 share the resources, different
deadlock situations and its avoidance
techniques.
Memory Management: Memory Management: Memory This will help student to know the
Hierarchy, Memory Types, Main Memory Architecture, concepts of different memories, and
Cache Memory, Address Binding, Dynamic Loading, its efficient management through
6 7
Linking, Overlays, Logical vs Physical Addresses, physical and virtualization.
Swapping, Contiguous Memory allocation,
Fragmentation, Segmentation.
Virtual Memory:Virtual Memory, Paging, Demand It will explore the concept about the
Paging, Page Replacement Algorithms, Thrashing; memory management through
7 5
virtualization.
8 Secondary memory Storage:Disk Structure, Disk 5 Help in understanding the
Scheduling, Disk Management; Case study: Unix and organization of files, database
DOS. through secondary type of memory
storages. Some different types of
operating system will bediscussed in
detailsto explore the knowledge.
Text Books:
1. Abraham Silberschatz, Peter B. Galvin, Greg Gagne,Operating System Concepts, 9th Edition, Wiley
Global Education, 2012
Reference Books:
1. William Stallings, Operating Systems: Internals and Design Principles, GOAL Series, Pearson international
edition, 2009.
