BSc CSIT · Semester IV
Operating Systems syllabus
Official TU syllabus for Operating Systems (CSC264): 7 units, 73 topics, 3 credit hours. Every unit links to its notes and solved questions.
1
Operating System Overview
4h · 3 Q- Definition
- Two views of operating system
- Evolution of operating system
- Types of OS
- System Call
- Handling System Calls
- System Programs
- Operating System Structures
- The Shell
- Open Source Operating Systems
2
Process Management
10h · 19 Q- Process vs Program
- Multiprogramming
- Process Model
- Process States
- Process Control Block
- Threads
- Thread vs Process
- User and Kernel Space Threads
- Inter Process Communication
- Race Condition
- Critical Section
- Implementing Mutual Exclusion: Mutual Exclusion with Busy Waiting (Disabling Interrupts, Lock Variables, Strict Alteration, Peterson's Solution, Test and Set Lock)
- Sleep and Wakeup
- Semaphore
- Monitors
- Message Passing
- Classical IPC problems: Producer Consumer, Sleeping Barber, Dining Philosopher Problem
- Process Scheduling: Goals, Batch System Scheduling (First-Come First-Served, Shortest Job First, Shortest Remaining Time Next), Interactive System Scheduling (Round-Robin Scheduling, Priority Scheduling, Multiple Queues), Overview of Real Time System Scheduling
3
Process Deadlocks
6h · 10 Q- Introduction
- Deadlock Characterization
- Preemptable and Non-preemptable Resources
- Resource - Allocation Graph
- Conditions for Deadlock
- Handling Deadlocks: Ostrich Algorithm, Deadlock prevention, Deadlock Avoidance, Deadlock Detection (For Single and Multiple Resource Instances), Recovery From Deadlock (Through Preemption and Rollback)
4
Memory Management
8h · 18 Q- Introduction
- Monoprogramming vs. Multi-programming
- Modelling Multiprogramming
- Multiprogramming with fixed and variable partitions
- Relocation and Protection
- Memory management (Bitmaps & Linked-list)
- Memory Allocation Strategies
- Virtual memory: Paging, Page Table, Page Table Structure, Handling Page Faults, TLB's
- Page Replacement Algorithms: FIFO, Second Chance, LRU, Optimal, LFU, Clock, WS-Clock
- Concept of Locality of Reference
- Belady's Anomaly
- Segmentation: Need of Segmentation, its Drawbacks, Segmentation with Paging(MULTICS)
5
File Management
6h · 9 Q- File Overview: File Naming, File Structure, File Types, File Access, File Attributes, File Operations, Single Level, two Level and Hierarchical Directory Systems, File System Layout
- Implementing Files: Contiguous allocation, Linked List Allocation, Linked List Allocation using Table in Memory, Inodes
- Directory Operations
- Path Names
- Directory Implementation
- Shared Files
- Free Space Management: Bitmaps, Linked List
6
Device Management
6h · 11 Q- Classification of IO devices
- Controllers
- Memory Mapped IO
- DMA Operation
- Interrupts
- Goals of IO Software
- Handling IO(Programmed IO, Interrupt Driven IO, IO using DMA)
- IO Software Layers (Interrupt Handlers, Device Drivers)
- Disk Structure
- Disk Scheduling (FCFS, SSTF, SCAN, CSCAN, LOOK, CLOOK)
- Disk Formatting (Cylinder Skew, Interleaving, Error handling)
- RAID
7
Linux Case Study
5h · 2 Q- History
- Kernel Modules
- Process Management
- Scheduling
- Inter-process Communication
- Memory Management
- File System Management Approaches
- Device Management Approaches
Textbooks and references
- Modern Operating Systems: Andrew S. Tanenbaum, PHI Publication, Third edition, 2008
- Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, "Operating System Concepts", John Wiley & Sons (ASIA) Pvt. Ltd, Seventh edition, 2005.
- Harvey M. Deitel, Paul J. Deitel, and David R. Choffnes, "Operating Systems, Prentice Hall, Third edition, 2003.
Study CSC264 the smart way
Solved questions, flashcards & practice