Syllabus

BIT · Semester III

Operating Systems syllabus

Official TU syllabus for Operating Systems (BIT204): 10 units, 80 topics. Every unit links to its notes and solved questions.

1

Operating System Fundamentals

7 Q
  • Definition and purpose of operating systems
  • Operating system as extended machine
  • Operating system components
  • Types of operating systems
  • Batch systems
  • Time sharing systems
  • Real time systems
  • Virtual machines and system protection
2

Operating System Structures

6 Q
  • Monolithic kernel structure
  • Microkernel structure
  • Kernel definition and role
  • System call definition and objectives
  • System call process and mechanism
  • Interrupt definition and occurrence
3

Process Management

4 Q
  • Process definition and characteristics
  • Program versus process distinction
  • Process Control Block
  • Process state transitions
  • 3-state process model
  • 5-state process model
  • Context switching
4

CPU Scheduling

4 Q
  • Scheduling objectives and criteria
  • FIFO scheduling algorithm
  • Shortest Job First scheduling
  • Priority scheduling
  • Round Robin scheduling
  • Turnaround time calculation
  • Waiting time calculation
  • Multiple queue scheduling
5

Concurrency and Synchronization

8 Q
  • Critical section problem
  • Race condition definition and examples
  • Lock variable solution
  • Semaphore operations
  • Producer consumer problem with semaphore
  • Producer consumer problem with message passing
  • Thread definition and characteristics
  • User level threads
  • Kernel level threads
  • Multithreading models
6

Deadlock Management

5 Q
  • Deadlock definition
  • Necessary conditions for deadlock
  • Resource Allocation Graph
  • Deadlock detection methods
  • Deadlock recovery techniques
  • Banker's Algorithm
  • Deadlock versus starvation
7

Memory Management

5 Q
  • Virtual memory technique and purpose
  • Logical address definition
  • Physical address conversion
  • Single level paging scheme
  • Segmentation with paging
  • Swapping definition
  • Memory compaction
  • Best fit memory allocation
  • Coalescing and compaction techniques
8

Virtual Memory and Paging

6 Q
  • Page fault definition and occurrence
  • FIFO page replacement algorithm
  • Second Chance page replacement algorithm
  • Optimal page replacement algorithm
  • LRU page replacement algorithm
  • Translation Lookaside Buffer
  • TLB importance in address conversion
9

Input Output and Disk Management

10 Q
  • Device controller definition
  • DMA definition and purpose
  • DMA working mechanism
  • Memory mapped I/O
  • Interrupt based I/O
  • DMA based I/O comparison
  • Device independent I/O software
  • Disk scheduling algorithms
  • RAID definition and levels
  • Disk error handling and formatting
10

File System and Storage Management

5 Q
  • File types and characteristics
  • Sequential file access
  • Random file access
  • File system implementation
  • Directory system implementation
  • Bitmap based free space management
  • File Allocation Table
  • Block size and allocation calculations

Study BIT204 the smart way

Solved questions, flashcards & practice