KBCNMU · Second Year B.E. Artificial Intelligence & Data Science · NEP 2020
Operating Systems
AIDS-401 · Semester IV · 3 credits · ISE 40 + ESE 60
Unit 1: Introduction, Processes and Threads
9 hoursTypes, functions and services of an operating system; layered, monolithic and microkernel structures; system calls; the process concept, states and transitions, the process control block and context switching; threads, their states, benefits and types.
Examined in the 60-mark end-semester paper
- Types of operating systems
- Operating system structures and virtual machines
- Process creation and system calls
- Process states and data structures
- Schedulers and context switching
- Threads and the thread API
Unit 2: Process Scheduling and Inter-process Communication
9 hoursSchedulers and scheduling criteria; pre-emptive and non-pre-emptive FCFS, SJF, round-robin and priority scheduling; critical sections, race conditions and mutual exclusion, Peterson's solution, semaphores, producer–consumer, readers–writers and dining philosophers.
Examined in the 60-mark end-semester paper
- Scheduling metrics
- FIFO, SJF and STCF scheduling
- Round robin scheduling
- Critical-section problem and Peterson's solution
- Semaphores
- Producer-consumer problem
- Reader-writer locks and dining philosophers
Unit 3: Deadlocks and Memory Management
9 hoursDeadlock conditions, prevention, avoidance with the banker's algorithm, detection and recovery; logical and physical addresses, contiguous allocation with fixed and variable partitions, fragmentation and compaction; paging and segmentation.
Examined in the 60-mark end-semester paper
- Deadlock prevention, avoidance and detection
- Banker's algorithm
- Address spaces and the memory API
- Contiguous allocation and fragmentation
- Paging
- Segmentation
Unit 4: Virtual Memory and File Management
9 hoursDemand paging, FIFO, optimal and LRU page replacement, thrashing; file attributes, operations, types and structure, access methods, directory structure, mounting, and contiguous, linked and indexed allocation.
Examined in the 60-mark end-semester paper
- Swapping and page faults
- Page replacement algorithms
- Locality and thrashing
- Files and directories
- File allocation methods
Unit 5: I/O Systems and Mass Storage
9 hoursI/O hardware, interrupts and DMA; disk structure and FCFS, SSTF, SCAN, C-SCAN and LOOK scheduling; disk and swap-space management and RAID.
Examined in the 60-mark end-semester paper
- Interrupts and DMA
- Hard disk drives
- Disk scheduling algorithms
- RAID levels
Unit contents are summarised from the official KBCNMU syllabus . AiCanCode.org is not affiliated with Kavayitri Bahinabai Chaudhari North Maharashtra University (KBCNMU).