Operating System syllabus
PCC-203-AID · Second Year Artificial Intelligence and Data Science, SPPU 2024 pattern. Every unit, the marks scheme, course outcomes and books, copied from the official syllabus PDF.
Unit-wise syllabus
Introduction to Operating System and Process
9 hoursIntroduction to operating systems, Types of OS, real time OS, the Linux Operating Systems Process: process abstraction, system calls for process management, process creation: process states, data structures, process execution mechanisms process api, process control and users
Case Study : Windows 11/Linux
Scheduling
9 hoursWorkload assumptions, scheduling metrics, response time, first in, first out (FIFO) shortest job first (SJF), shortest time-to-completion first (STCF), round robin, incorporating I/O, the multi-level feedback queue, the priority boost, attempt, better accounting, multiprocessor scheduling, synchronization, cache affinity, single-queue scheduling multi-queue scheduling, Linux multiprocessor schedulers.
Case Study - Scheduling and Synchronization in xv6
Address Spaces
9 hoursEarly systems, multiprogramming and time sharing, the address space, virtualization of memory, memory api: types of memory, the malloc() call, the free() call, segmentation, fine-grained vs. coarsegrained segmentation, free-space management, paging, a memory trace, faster translations (TLBs), TLB basic algorithm, TLB issue: context switches, replacement policy, hybrid approach: paging and segments, beyond physical memory: mechanisms, swap space, the page fault, page fault control flow.
Case Study - Linux/Windows Memory Management
Concurrency
9 hoursConcurrency, persistence, Shared data, uncontrolled scheduling, the wish for atomicity, thread api : need of threads, thread creation, thread completion Locks: the basic idea, pthread locks, building a lock, evaluating locks, controlling interrupts, failed attempt, just using Semaphores: definition, binary semaphores (locks), semaphores for ordering, the producer/consumer (bounded buffer) problem, reader-writer locks, dining philosophers’ problem, how to implement semaphores, common concurrency problems.
Case Study : Thread programming Using Pthreads, POSIX
I/O Management
9 hoursSystem architecture, A Canonical device, The Canonical protocol, CPU virtualization, Lowering CPU Overhead with Interrupts, More efficient data movement With DMA, Methods of device interaction, Fitting into the OS: The device driver,
Case Study: A simple IDE disk driver, Hard disk drives, files and directories, The fast file system, file system implementation, disk failure modes, handling latent sector error, detecting corruption: the checksum, using checksums
Case Study - I/O Management in Linux/Windows operating system
Marks and credits
| Head | Marks | Credit |
|---|---|---|
| CCE (continuous comprehensive evaluation) | 30 | 3 |
| End-semester exam | 70 |
Prerequisite: Basic Understanding of Computer Systems, Fundamentals of Programming Languages.
Course outcomes
- CO1Use the concepts of virtualization and process management
- CO2Analyse various scheduling algorithms
- CO3Discuss various memory management techniques
- CO4Describe the working of concurrency and locking mechanism in operating systems
- CO5Elaborate I/O management concepts
Books
Text books
- Remzi H. Arpaci-Dusseau and Andrea C. Arpaci-Dusseau “Operating Systems: Three Easy Pieces
- William Stallings, Operating System: Internals and Design Principles, Prentice Hall, ISBN-10: 0-13-380591-3, ISBN-13: 978-0-13-380591-8, 8th Edition
Reference books
- Silberschatz, A, Galvin, P.B, and Gagne, G., “Operating System Principles”, Eight Edition, John Wiley & Sons, 2008.
- Bach Maurice J. “The Design of the UNIX Operating System”, Second Edition Prentice Hall of India, 2001
- Operating System Concepts, Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, WILEY, ISBN 978-1-118-06333-0, 9th Edition E-Book
- https://repository.dinus.ac.id/docs/ajar/Operating_System.pdf 21
NPTEL and SWAYAM links
Listed in the official syllabus:
FAQ
How many units are in Operating System?
Operating System (PCC-203-AID) has 5 units and 45 hours of theory: Unit I Introduction to Operating System and Process (9 h); Unit II Scheduling (9 h); Unit III Address Spaces (9 h); Unit IV Concurrency (9 h); Unit V I/O Management (9 h).
What is the marks scheme for Operating System?
The official Artificial Intelligence and Data Science 2024 pattern syllabus lists continuous comprehensive evaluation (CCE) for 30 marks and the end-semester exam for 70 marks, for 3 credits.
What should I know before Operating System?
Prerequisite listed in the syllabus: Basic Understanding of Computer Systems, Fundamentals of Programming Languages.