Skip to content
CampusPrep
AD-405 · Operating Systems/Official Syllabus

Operating Systems (AD-405) - Official Syllabus

1
Unit 1

Introduction to Operating Systems

  • Function
  • Evolution
  • Desirable Characteristics and features of an O/S
  • Operating Systems Services: Types of Services
  • Different ways of providing these Services – Utility Programs
  • System Calls
2
Unit 2

Process Management

  • Concept of a process
  • Process State Diagram
  • Process based kernel
  • Dual mode of process execution
  • CPU scheduling algorithms
  • deterministic modeling
  • System calls for Process Management
  • Concept of Threads: User level & Kernel level Threads
  • Process Management in UNIX & Windows
  • Inter Process Communication: Real and Virtual Concurrency
  • Mutual Exclusion
  • Synchronization
  • Critical Section Problem
  • Solution to Critical Section Problem : Semaphores and their Operations and their implementation
  • Deadlocks: Deadlock Problems
  • Characterization
  • Prevention
  • Avoidance
  • Recovery
  • IPC in UNIX & Windows
3
Unit 3

Memory Management

  • Different Memory Management Techniques – Partitioning
  • Swapping
  • Segmentation
  • Paging
  • Paged Segmentation
  • Comparison of these techniques
  • Techniques for supporting the execution of large programs: Overlay
  • Dynamic Linking and Loading
  • Virtual Memory – Concept
  • Implementation by Demand Paging etc.
  • Memory management in UNIX & Windows
4
Unit 4

File Systems Management

  • File Concept
  • User’s and System Programmer’s view of File System
  • Disk Organization
  • Tape Organization
  • Different Modules of a File System
  • Disk Space Allocation Methods – Contiguous, Linked, Indexed
  • Directory Structures
  • File Protection
  • System Calls for File Management
  • Disk Scheduling Algorithms
  • File Systems in UNIX & Windows
5
Unit 5

Input / Output Management

  • Principles and Programming
  • Input/Output Problems
  • Different I/O operations: Program Controlled
  • Interrupt Driven
  • Concurrent I/O
  • Asynchronous Operations
  • Logical structure of I/O function
  • I/O Buffering
  • Kernel I/o Subsystem
  • Introduction to Network, Distributed and Multiprocessor Operating Systems
  • I/O management in UNIX & Windows

Laboratory Experiments

  • Write a program to implement FCFS CPU scheduling algorithm.
  • Write a program to implement SJF CPU scheduling algorithm.
  • Write a program to implement Priority CPU Scheduling algorithm.
  • Write a program to implement Round Robin CPU scheduling algorithm.
  • Write a program to compare various CPU Scheduling Algorithms over different Scheduling Criteria.
  • Write a program to implement classical inter process communication problem (producer consumer).
  • Write a program to implement classical inter process communication problem (Reader Writers).
  • Write a program to implement classical inter process communication Problem (Dining_Philosophers).
  • Write a program to implement & Compare various page replacement algorithms.
  • Write a program to implement & Compare various Disk & Drum scheduling Algorithms
  • Write a program to implement Banker’s algorithms.
  • Write a program to implement Remote Procedure Call (RPC).
  • Write a Devices Drivers for any Device or peripheral.

Reference Books

  • Modern Operating Systems — Andrew S. Tanenbaum — Prentice Hall — 3/e
  • The Design of Unix Operating System — Maurice J. Bach — Prentice Hall of India
  • Understanding the Linux Kernel — Bovet, Cesati — O’Reily — 2/E
  • Operating System Concepts — Silberschatz, Galvin, Gagne — Wiley — 9/E
  • Operating Systems — William Stalling — Pearson Education
Go to where you left off?

Quick Add to Notes

Save questions, your own notes and screenshots into notes filed by unit. It takes a free account.

Create free account

Have an account? Log in