DBATU SY AI syllabus

DBATU · Second Year B.Tech Artificial Intelligence & Allied · NEP 2020

Introduction to Operating Systems

25AFAIPC401 · Semester IV · 3 credits · Continuous assessment 20 + mid-semester 20 + end-semester 60

All notes for this subject
  1. Unit 1: Introduction and Operating System Structures

    6 hours

    Definition and types of operating systems, real-time systems; system components, services, system calls and system programs; system structure, virtual machines, design and implementation.

    Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then

    • Types of operating systems
    • Process creation and system calls
    • Operating system structures and virtual machines
  2. Unit 2: Processes and CPU Scheduling

    6 hours

    The process concept, scheduling and operations; inter-process communication and cooperating processes; threads and multithreading models; scheduling criteria and algorithms, thread and multiprocessor scheduling, and evaluating algorithms.

    Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then

    • The process abstraction
    • Inter-process communication
    • Threads and the thread API
    • Scheduling metrics
    • FIFO, SJF and STCF scheduling
    • Round robin scheduling
    • Multiprocessor scheduling
  3. Unit 3: Process Synchronisation and Deadlocks

    6 hours

    The critical-section problem, critical regions and Peterson's solution; synchronisation hardware, semaphores, classical synchronisation problems and monitors; the deadlock model and characterisation, prevention, avoidance, detection and recovery.

    Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then

    • Critical-section problem and Peterson's solution
    • Semaphores
    • Producer-consumer problem
    • Reader-writer locks and dining philosophers
    • Monitors
    • Deadlock prevention, avoidance and detection
  4. Unit 4: Memory Management and Virtual Memory

    10 hours

    Logical and physical addresses; contiguous, fixed and variable partition allocation, fragmentation and compaction; paging, its hardware support, protection and sharing; segmentation; virtual memory, locality, working sets and dirty bits, demand paging and the optimal, FIFO, second-chance, NRU and LRU page replacement algorithms.

    Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then

    • Contiguous allocation and fragmentation
    • Paging
    • Segmentation
    • Swapping and page faults
    • Page replacement algorithms
  5. Unit 5: File Management and Mass Storage

    8 hours

    File concept, access methods, types and operations; directory and disk structure; file-system structure and implementation; contiguous, linked and indexed allocation; free-space management and directory implementation; disk structure, attachment, scheduling and management, and swap-space management.

    Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then

    • Files and directories
    • File system implementation
    • File allocation methods
    • File-system free-space management
    • Disk scheduling algorithms

Unit contents are summarised from the official DBATU syllabus . AiCanCode.org is not affiliated with Dr. Babasaheb Ambedkar Technological University (DBATU).