Operating Systems

UNIT 1: Introduction (15 Hrs)

• Operating System
• Simple Batch Systems
• Multi-programmed Batches Systems
• Time-Sharing Systems
• Personal-computer Systems
• Parallel Systems
• Distributed Systems
• Real-Time Systems
• OS – A Resource Manager
• Processes
  • Introduction to Processes
  • Process States
  • Process Management
  • Interrupts
  • Inter-process Communication
• Threads
  • Introduction to Threads
• Processor Scheduling
  • Pre-emptive vs Non-pre-emptive Scheduling
  • Scheduling Criteria
  • Scheduling Algorithms

UNIT 2: Process Synchronization (15 Hrs)

• Process Synchronization
  • Mutual Exclusion
  • Semaphores
  • Critical Section Problems
• Case Study: Dining Philosopher Problem
• Deadlocks
  • Resource Concepts
  • Deadlock
  • Deadlock Solution
  • Deadlock Prevention
  • Deadlock Avoidance with Bankers Algorithm
  • Deadlock Detection
  • Deadlock Recovery

UNIT 3: Memory & Device Management (15 Hrs)

• Memory Management
  • Memory Hierarchy
  • Memory Management Strategies
  • Contiguous vs Non-Contiguous Memory Allocation
  • Partition Management Techniques
  • Logical vs Physical Address Space
  • Swapping
  • Paging
  • Segmentation
• Virtual Memory
  • Virtual Memory Concepts
  • Page Replacement
  • Page Replacement Algorithms (FIFO & LRU)
  • Thrashing
• Device Management
  • Disk Structure
  • Disk Scheduling Strategies (FCFS & SCAN)
  • Caching and Buffering
• File System
  • Introduction to File System
  • File Organization

Sample Lab Work (indicative) (1 Credit, 30 Hours)

1. Installation of Windows Operating System
2. Write program to Demonstrate Deadlock Detection
3. Write program to Demonstrate Deadlock Avoidance with Semaphores
4. Write programs to implement FCFS CPU Scheduling Algorithm
5. Write programs to implement SJF CPU Scheduling Algorithm
6. Write programs to implement Round Robin CPU Scheduling Algorithm
7. Write programs to implement Priority CPU Scheduling Algorithm
8. Write programs to implement First Fit Memory Allocation Methods
9. Write programs to implement Worst Fit Memory Allocation Methods
10. Write programs to implement Best Fit Memory Allocation Methods
11. Write programs to implement the various FIFO Page Replacement Algorithm
12. Write programs to implement the various LRU Page Replacement Algorithm
13. Write programs to Implement FCFS Disk Scheduling Strategy
14. Write programs to Implement SCAN Disk Scheduling Strategy
15. Write programs to create and read files and directories on a file system

SUGGESTED READING

1. Silberschatz and Galvin, “Operating System Concepts”, Pearson, 5th Ed., 2001.
2. Tannenbaum, “Operating Systems”, PHI, 4th Edition, 2000.
3. Godbole, “Operating Systems”, Tata McGraw Hill, 3rd edition, 2014.
4. Deitel & Dietel, “Operating System”, Pearson, 3rd Ed, 2011.