PAHSU SY AI&DS syllabus

PAHSU · Second Year B.Tech. Artificial Intelligence and Data Science · NEP 2020

Computer Architecture and Operating System

ADPCC-03 · Semester III · 3 credits · ISE 30 + ESE 70

Its operating-system units (IV to VI) use the Operating Systems notes; the course also carries 25 marks of internal continuous assessment.

  1. Unit 1: Fundamentals of Computer Organization, Instruction Sets and Memory

    6 hours

    History and generations of computers; the Von Neumann model and basic components; the system bus model; instruction set architecture and basic instructions, RISC versus CISC; number systems and base conversion; memory addressing modes and the memory hierarchy.

    Examined in the 70-mark end-semester paper

    • Functional units of a computer
    • System buses and bus arbitration
    • Instruction set characteristics and operand types
    • RISC and CISC architectures
    • Number systems and conversions
    • Addressing modes
    • The memory hierarchy
  2. Unit 2: Parallel Programming Models and I/O Organization

    6 hours

    Parallel programming models; external devices and the I/O module; programmed I/O, interrupt-driven I/O and direct memory access; I/O channels and processors; the external interface.

    Examined in the 70-mark end-semester paper

    • Parallel and distributed computing
    • I/O subsystems and programmed I/O
    • Interrupts and DMA
    • I/O channels and I/O processors
    • USB and I/O device interfaces
  3. Unit 3: Pipelining and Instruction-Level Parallelism

    6 hours

    Pipelining and pipeline hazards; linear and nonlinear pipelines; the MESI protocol; ILP concepts and challenges, branch prediction, dynamic scheduling and hardware speculation; multiple issue and static scheduling.

    Examined in the 70-mark end-semester paper

    • Instruction pipelining: throughput and speedup
    • Pipeline hazards and their solutions
    • Reservation tables and arithmetic pipelines
    • Shared memory and cache coherence
    • Instruction-level parallelism and branch prediction
    • Dynamic scheduling and hardware speculation
    • Multiple-issue processors and static scheduling
  4. Unit 4: Process Management in Operating System

    6 hours

    Introduction to operating systems; the process concept; process scheduling and scheduling algorithms; threads; multiprocessor scheduling; inter-process communication; the critical-section problem, semaphores and the classical synchronisation problems.

    Examined in the 70-mark end-semester paper

    • Types of operating systems
    • The process abstraction
    • FIFO, SJF and STCF scheduling
    • Round robin scheduling
    • Threads and the thread API
    • Multiprocessor scheduling
    • Inter-process communication
    • Critical-section problem and Peterson's solution
    • Semaphores
    • Producer-consumer problem
    • Reader-writer locks and dining philosophers
  5. Unit 5: Memory Management in Operating System

    6 hours

    Logical versus physical address space; swapping; contiguous allocation; paging, segmentation and segmentation with paging; virtual memory; mass-storage structure and disk scheduling.

    Examined in the 70-mark end-semester paper

    • Address spaces and the memory API
    • Swapping and page faults
    • Contiguous allocation and fragmentation
    • Paging
    • Segmentation
    • Page replacement algorithms
    • Disk scheduling algorithms
  6. Unit 6: File Management in Operating System

    6 hours

    The file concept and access methods; directory and disk structure; file-system structure and implementation; directory implementation; allocation methods.

    Examined in the 70-mark end-semester paper

    • Files and directories
    • File system implementation
    • File allocation methods

Unit contents are summarised from the official PAHSU syllabus . AiCanCode.org is not affiliated with Punyashlok Ahilyadevi Holkar Solapur University (PAHSU).