RTMNU SY AI syllabus

RTMNU · Second Year B.Tech Artificial Intelligence · NEP 2020

Operating Systems

BAI3T10 · Semester III · 2 credits · College 30 + university 70

A 2-credit course.

All notes for this subject
  1. Unit 1: Introduction

    7 hours

    Evolution and types of operating systems, the hardware support they need, their services, system programs and system calls; layered, monolithic and microkernel structures; the file concept, access methods, directory structures, recovery and log-structured file systems.

    Examined in the 70-mark end-semester paper

    • Types of operating systems
    • Operating system structures and virtual machines
    • Process creation and system calls
    • Files and directories
    • Log-structured file systems
  2. Unit 2: Disk Space and Memory Management

    7 hours

    Disk space management and allocation strategies and disk arm scheduling; contiguous and non-contiguous allocation, paging, segmentation, demand paging, page faults, page replacement, thrashing and virtual memory.

    Examined in the 70-mark end-semester paper

    • File allocation methods
    • Disk scheduling algorithms
    • Contiguous allocation and fragmentation
    • Paging
    • Segmentation
    • Swapping and page faults
    • Page replacement algorithms
    • Locality and thrashing
  3. Unit 3: Process Scheduling

    8 hours

    The process concept and PCB, types of scheduler, context switching, threads and multithreading models, the goals of scheduling and CPU scheduling algorithms.

    Examined in the 70-mark end-semester paper

    • Process states and data structures
    • Schedulers and context switching
    • Threads and the thread API
    • Scheduling metrics
    • FIFO, SJF and STCF scheduling
    • Round robin scheduling
  4. Unit 4: Process Cooperation and Synchronization

    7 hours

    Concurrency conditions, the critical-section problem with software and hardware solutions, semaphores, conditional critical regions and monitors, and the classical inter-process communication problems.

    Examined in the 70-mark end-semester paper

    • Critical-section problem and Peterson's solution
    • Semaphores
    • Monitors
    • Producer-consumer problem
    • Reader-writer locks and dining philosophers
  5. Unit 5: Deadlocks and Protection

    7 hours

    Deadlock characteristics, prevention, avoidance, detection and recovery; goals of protection, the access matrix and its implementation, and the security problem.

    Examined in the 70-mark end-semester paper

    • Deadlock prevention, avoidance and detection
    • Banker's algorithm
    • Protection and security in operating systems

Unit contents are summarised from the official RTMNU syllabus . AiCanCode.org is not affiliated with Rashtrasant Tukadoji Maharaj Nagpur University (RTMNU).