Syllabus(Semester Exam)
Unit – I Introduction : Operating system and functions, Classification of Operating systems- Batch, Interactive, Time
Time System, Multiprocessor Systems, Multiuser Systems, Multiprocess Systems, Multithreaded Systems, Operating
Structure- Layered structure, System Components, Operating System services, Reentrant Kernels, Monolithic and M
Systems.
Unit – II CPU Scheduling: Scheduling Concepts, Performance Criteria, Process States, Process Transition Diagram, Sc
Process Control Block (PCB), Process address space, Process identification information, Threads and their managem
Scheduling Algorithms, Multiprocessor Scheduling. Deadlock: System model, Deadlock characterization, Prevention
and detection, Recovery from deadlock.
Unit – III Concurrent Processes: Process Concept, Principle of Concurrency, Producer / Consumer Problem, Mutual
Critical Section Problem, Dekker’s solution, Peterson’s solution, Semaphores, Test and Set operation; Classical Prob
Concurrency- Dining Philosopher Problem, Sleeping Barber Problem; Inter Process Communication models and Sch
generation.
Unit – IV Memory Management: Basic bare machine, Resident monitor, Multiprogramming with fixed partitions,
Multiprogramming with variable partitions, Protection schemes, Paging, Segmentation, Paged segmentation, Virtua
concepts, Demand paging, Performance of demand paging, Page replacement algorithms, Thrashing, Cache memo
organization, Locality of reference.
Unit – V I/O Management and Disk Scheduling: I/O devices, and I/O subsystems, I/O buffering, Disk storage and di
RAID. File System: File concept, File organization and access mechanism, File directories, and File sharing, File syste
Knowledge Gate Website
implementation issues, File system protection and security.
, Chapters of This Video
(Chapter-1: Introduction)- Operating system, Goal & functions, System Components, Operating System serv
Classification of Operating systems- Batch, Interactive, Multiprogramming, Multiuser Systems, Time sharing,
Multiprocessor Systems, Real Time System.
(Chapter-2: Operating System Structure)- Layered structure, Monolithic and Microkernel Systems, Interface
Chapter-3: Process Basics)- Process Control Block (PCB), Process identification information, Process States, P
Transition Diagram, Schedulers, CPU Bound and i/o Bound, Context Switch.
(Chapter-4: CPU Scheduling)- Scheduling Performance Criteria, Scheduling Algorithms.
(Chapter-5: Process Synchronization)- Race Condition, Critical Section Problem, Mutual Exclusion,, Dekker’s
Peterson’s solution, Process Concept, Principle of Concurrency,
(Chapter-6: Semaphores)- Classical Problem in Concurrency- Producer/Consumer Problem, Reader-Writer P
Dining Philosopher Problem, Sleeping Barber Problem, Test and Set operation.
(Chapter-7: Deadlock)- System model, Deadlock characterization, Prevention, Avoidance and detection, Rec
deadlock.
(Chapter-8)- Fork Command, Multithreaded Systems, Threads and their management
(Chapter-9: Memory Management)- Memory Hierarchy, Locality of reference, Multiprogramming with fixed
Multiprogramming with variable partitions, Protection schemes, Paging, Segmentation, Paged segmentation
(Chapter-10: Virtual memory)- Demand paging, Performance of demand paging, Page replacement algorith
Thrashing.
Chapter-11: Disk Management)- Disk Basics, Disk storage and disk scheduling, Total Transfer time.
(Chapter-12: File System)- File allocation Methods, Free-space Management, File organization and access m
Knowledge Gate Website
File directories, and File sharing, File system implementation issues, File system protection and security.
, What is Operating System
1. Intermediatory – Acts as an intermediary between user & h/w .
Knowledge Gate Website
, What is Operating System
2. Resource Manager/Allocator – Operating system controls and coordina
use of system resources among various application programs in an unbiase
fashion.
Knowledge Gate Website
Unit – I Introduction : Operating system and functions, Classification of Operating systems- Batch, Interactive, Time
Time System, Multiprocessor Systems, Multiuser Systems, Multiprocess Systems, Multithreaded Systems, Operating
Structure- Layered structure, System Components, Operating System services, Reentrant Kernels, Monolithic and M
Systems.
Unit – II CPU Scheduling: Scheduling Concepts, Performance Criteria, Process States, Process Transition Diagram, Sc
Process Control Block (PCB), Process address space, Process identification information, Threads and their managem
Scheduling Algorithms, Multiprocessor Scheduling. Deadlock: System model, Deadlock characterization, Prevention
and detection, Recovery from deadlock.
Unit – III Concurrent Processes: Process Concept, Principle of Concurrency, Producer / Consumer Problem, Mutual
Critical Section Problem, Dekker’s solution, Peterson’s solution, Semaphores, Test and Set operation; Classical Prob
Concurrency- Dining Philosopher Problem, Sleeping Barber Problem; Inter Process Communication models and Sch
generation.
Unit – IV Memory Management: Basic bare machine, Resident monitor, Multiprogramming with fixed partitions,
Multiprogramming with variable partitions, Protection schemes, Paging, Segmentation, Paged segmentation, Virtua
concepts, Demand paging, Performance of demand paging, Page replacement algorithms, Thrashing, Cache memo
organization, Locality of reference.
Unit – V I/O Management and Disk Scheduling: I/O devices, and I/O subsystems, I/O buffering, Disk storage and di
RAID. File System: File concept, File organization and access mechanism, File directories, and File sharing, File syste
Knowledge Gate Website
implementation issues, File system protection and security.
, Chapters of This Video
(Chapter-1: Introduction)- Operating system, Goal & functions, System Components, Operating System serv
Classification of Operating systems- Batch, Interactive, Multiprogramming, Multiuser Systems, Time sharing,
Multiprocessor Systems, Real Time System.
(Chapter-2: Operating System Structure)- Layered structure, Monolithic and Microkernel Systems, Interface
Chapter-3: Process Basics)- Process Control Block (PCB), Process identification information, Process States, P
Transition Diagram, Schedulers, CPU Bound and i/o Bound, Context Switch.
(Chapter-4: CPU Scheduling)- Scheduling Performance Criteria, Scheduling Algorithms.
(Chapter-5: Process Synchronization)- Race Condition, Critical Section Problem, Mutual Exclusion,, Dekker’s
Peterson’s solution, Process Concept, Principle of Concurrency,
(Chapter-6: Semaphores)- Classical Problem in Concurrency- Producer/Consumer Problem, Reader-Writer P
Dining Philosopher Problem, Sleeping Barber Problem, Test and Set operation.
(Chapter-7: Deadlock)- System model, Deadlock characterization, Prevention, Avoidance and detection, Rec
deadlock.
(Chapter-8)- Fork Command, Multithreaded Systems, Threads and their management
(Chapter-9: Memory Management)- Memory Hierarchy, Locality of reference, Multiprogramming with fixed
Multiprogramming with variable partitions, Protection schemes, Paging, Segmentation, Paged segmentation
(Chapter-10: Virtual memory)- Demand paging, Performance of demand paging, Page replacement algorith
Thrashing.
Chapter-11: Disk Management)- Disk Basics, Disk storage and disk scheduling, Total Transfer time.
(Chapter-12: File System)- File allocation Methods, Free-space Management, File organization and access m
Knowledge Gate Website
File directories, and File sharing, File system implementation issues, File system protection and security.
, What is Operating System
1. Intermediatory – Acts as an intermediary between user & h/w .
Knowledge Gate Website
, What is Operating System
2. Resource Manager/Allocator – Operating system controls and coordina
use of system resources among various application programs in an unbiase
fashion.
Knowledge Gate Website