StudiousStart free

16 units · 52 lessons

Operating Systems

Operating Systems from the first idea to exam level: every lesson builds on the one before, with a worked example, a step-through diagram where it helps, a quick check and practice that adapts to what you know. Follows Silberschatz, Galvin & Gagne, Operating System Concepts, 10th ed..

Operating Systems at a glance

What does Operating Systems cover?

OS Concepts & Structure, Processes & IPC, Threads, CPU Scheduling, Synchronization, Deadlocks, Main Memory, Virtual Memory, File Systems and Mass Storage. It follows Silberschatz, Galvin & Gagne, Operating System Concepts, 10th ed..

How many lessons does the Operating Systems course on Studious have?

16 units and 52 lessons, from "What an operating system does" to "RAID levels". Each lesson has a worked example, a quick check and practice that adapts to what you know, and many have step-by-step diagrams.

Course outline

  1. Unit 1 · Week 1

    Introduction to Operating Systems

    1. What an operating system does
    2. Interrupts, dual mode and system calls
    3. Kinds of operating systems
  2. Unit 2 · Week 2

    Operating-System Structures

    1. OS services and system calls
    2. How an OS is built: monolithic, layered, microkernel
    3. Booting a computer
  3. Unit 3 · Week 3

    Processes

    1. The process and its states
    2. The PCB and context switching
    3. Process scheduling queues and schedulers
  4. Unit 4 · Week 4

    Process Operations and IPC

    1. Creating processes: fork, exec and wait
    2. Shared memory and message passing
    3. Pipes and the producer–consumer buffer
  5. Unit 5 · Week 5

    Threads

    1. Threads vs processes
    2. Multithreading models
    3. Pthreads and threading issues
  6. Unit 6 · Week 6

    CPU Scheduling Basics

    1. Scheduling criteria and terms
    2. First-Come, First-Served
    3. Shortest-Job-First and SRTF
  7. Unit 7 · Week 7

    Priority, Round Robin and Multilevel Queues

    1. Priority scheduling and aging
    2. Round Robin and the time quantum
    3. Multilevel queue and feedback queue
  8. Unit 8 · Week 8

    Process Synchronization

    1. Race conditions and the critical-section problem
    2. Peterson's solution and hardware support
    3. Mutex locks and semaphores
  9. Unit 9 · Week 9

    Classic Synchronization Problems

    1. The bounded-buffer problem
    2. Readers–writers
    3. Dining philosophers and monitors
  10. Unit 10 · Week 10

    Deadlocks

    1. The four conditions for deadlock
    2. Resource-allocation graphs
    3. Deadlock prevention
  11. Unit 11 · Week 11

    Deadlock Avoidance and Detection

    1. Safe states
    2. The Banker's algorithm
    3. Deadlock detection and recovery
  12. Unit 12 · Week 12

    Main Memory

    1. Logical and physical addresses
    2. Contiguous allocation: first, best and worst fit
    3. Fragmentation and compaction
  13. Unit 13 · Week 13

    Paging and Segmentation

    1. Paging and address translation
    2. The TLB and effective access time
    3. Page-table structures
    4. Segmentation
  14. Unit 14 · Week 14

    Virtual Memory

    1. Demand paging and page faults
    2. FIFO page replacement and Belady's anomaly
    3. Optimal and LRU replacement
    4. Thrashing and the working set
  15. Unit 15 · Week 15

    File Systems

    1. Files and access methods
    2. Directory structures
    3. Allocation methods: contiguous, linked, indexed
    4. Free-space management
  16. Unit 16 · Week 16

    Mass Storage and Disk Scheduling

    1. Disk structure and access time
    2. FCFS and SSTF disk scheduling
    3. SCAN, C-SCAN and LOOK
    4. RAID levels

Study every lesson with diagrams, practice and Buddy, your AI tutor.

Start studying free