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

Operating Systems (CS-405) - Official Syllabus

1
Unit 1

Introduction to Operating Systems

  • Function
  • Evolution
  • Different Types
  • 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

File Systems

  • 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
3
Unit 3

CPU Scheduling and Memory Management

  • Process Concept
  • Scheduling Concepts
  • Types of Schedulers
  • Process State Diagram
  • Scheduling Algorithms
  • Algorithms Evaluation
  • System calls for Process Management
  • Multiple Processor Scheduling
  • Concept of Threads
  • 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
4
Unit 4

Input / Output and Concurrent Processes

  • Input / Output : Principles and Programming
  • Input/Output Problems
  • Asynchronous Operations
  • Speed gap Format conversion
  • I/O Interfaces
  • Programme Controlled I/O
  • Interrupt Driven I/O
  • Concurrent I/O
  • Real and Virtual Concurrency
  • Mutual Exclusion
  • Synchronization
  • Inter- Process Communication
  • Critical Section Problem
  • Solution to Critical Section Problem : Semaphores – Binary and Counting Semaphores, WAIT & SIGNAL Operations and their implementation
  • Deadlocks: Deadlock Problems, Characterization, Prevention, Avoidance, Recovery
5
Unit 5

Network, Distributed and Multiprocessor Operating Systems & Case Studies

  • Introduction to Network, Distributed and Multiprocessor Operating Systems
  • Case Studies: Unix/Linux
  • Case Studies: WINDOWS and other Contemporary Operating Systems

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 algorithm.
  • 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 Proccedure Call(RPC).
  • Write a Devices Drivers for any Device or pheriperal.

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