RTMNU SY AI & DS syllabus

RTMNU · Second Year B.Tech Artificial Intelligence & Data Science · NEP 2020

Operating System

BAD4T14 · Semester IV · 3 credits · College 30 + university 70

  1. Unit 1: Introduction

    8 hours

    Evolution and types of operating systems, the hardware support they need, their services and functions, the kernel and modes of operation, system programs and system calls, interrupts and exceptions.

    Examined in the 70-mark end-semester paper

    • Types of operating systems
    • Operating system structures and virtual machines
    • Process creation and system calls
    • Interrupts and DMA
  2. Unit 2: File Systems

    7 hours

    The file concept and access methods, disk space management and allocation strategies, directory structures, and disk arm scheduling with numericals.

    Examined in the 70-mark end-semester paper

    • Files and directories
    • File allocation methods
    • File-system free-space management
    • Disk scheduling algorithms
  3. Unit 3: CPU Scheduling

    7 hours

    The process concept and process control block, types of scheduler, context switching, multithreading models and scheduling algorithms.

    Examined in the 70-mark end-semester paper

    • The process abstraction
    • Process states and data structures
    • Schedulers and context switching
    • Threads and the thread API
    • FIFO, SJF and STCF scheduling
    • Round robin scheduling
    • Multilevel feedback queue
  4. Unit 4: Memory Management

    7 hours

    Contiguous and non-contiguous allocation, paging, segmentation and segmentation with paging, the TLB, page replacement algorithms, locality, thrashing and garbage collection.

    Examined in the 70-mark end-semester paper

    • Contiguous allocation and fragmentation
    • Paging
    • Segmentation
    • Translation lookaside buffers
    • Page replacement algorithms
    • Locality and thrashing
    • Garbage collection
  5. Unit 5: Deadlocks and Synchronization

    7 hours

    Deadlock detection, prevention and avoidance (Banker's algorithm), resource allocation graphs, protection and the access matrix; concurrency conditions, the critical-section problem, semaphores, classical IPC problems and monitors.

    Examined in the 70-mark end-semester paper

    • Deadlock prevention, avoidance and detection
    • Banker's algorithm
    • Protection and security in operating systems
    • Critical-section problem and Peterson's solution
    • Semaphores
    • Reader-writer locks and dining philosophers
    • Monitors

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