Operating System: Make The Fundamentals Rock Solid+PDF Notes

(Ongoing) Academically Oriented Operating System Advanced Course : Mastering Core Concepts with 200+ Top Notch Examples

Operating System: Make The Fundamentals Rock Solid+PDF Notes
Operating System: Make The Fundamentals Rock Solid+PDF Notes

Operating System: Make The Fundamentals Rock Solid+PDF Notes free download

(Ongoing) Academically Oriented Operating System Advanced Course : Mastering Core Concepts with 200+ Top Notch Examples

This course represents the epitome of comprehensive learning available on this platform, a claim I can confidently stand by. Every effort has been dedicated to delving into the minutiae of the subject matter. Leveraging Numerical and Practice Sessions, I've endeavored to fortify your understanding of OS concepts and foundational principles. The breadth of topics covered is extensive, and even if you possess a rudimentary understanding of OS, you'll undoubtedly appreciate the depth this course explores:

Curriculum : 


1. Introduction and Background:


   a. Defining an OS:

  •   Elucidated through 5 Definitions

  •   Von Neumann Architecture

  •   Stored Program Concept

  •   Significance of Main Memory

  •   OS as Interface

  •   OS Kernel

  •   OS as Resource Manager

  •   OS as Control Program


  b. Types of OS:

  •   Uni-programming and Multiprogramming

  •   Degree of Multiprogramming

  •   Addressing CPU Idleness

  •   Throughput

  •   Schematic View of Multiprogramming

  •   Types of Multiprogramming OS

  •   Comparison between Multiprogramming and Multitasking OS

  •   Architectural Requirements for Implementing Multitasking OS

  •   Kernel & User Mode


  c. User and Kernel Mode Shifting:

  •    APIs

  •    Fork system call

  •    Interrupt

  •    ISR

  •    PSW

  •    Types of Functions

  •    Perspective on Mode Shifting


2. Process Management:


  a. Understanding Processes:

  •     Distinguishing between program and process

  •     Key C Concepts

  •     7 Definitions of Process

  •     Treating Process as an ADT (Abstract Data Type)

  •     Various Process Operations

  •     Process Attributes and PCB


   b. Process Transition Diagram:

  •     Different Process States

  •     Process State Transition Diagram

  •     Introduction to Schedulers and Dispatchers

  •     Addressing Common Doubts


   c .Scheduling Queues and State Queuing Diagrams:

  •      Detailed Examination of Schedulers and Dispatchers

  •      Context Switching


3. CPU Scheduling:


   a. Introduction and Process Times:

  •      Implementation of Short-Term Schedulers

  •      Functions and Objectives

  • Understanding Process Times (AT, BT, TAT, IOBT, CT, Schedule Length)


   b.   FCFS:

  •      Selection Criteria

  •      Operational Mode

  •      Conflict Resolution

  •      Assumptions

  •      Challenges with FCFS Scheduling

  •      Gantt Chart

  •      % CPU Idleness and Efficiency


   c. FCFS with Dispatch Latency and IOBT:

  •      Addressing the Most Complex FCFS Problems

  •      Regular Discussion of Home- Work Problems

d. Shortest Job First ( Preemptive and Non Preemptive Case ) 

  •    Selection Criteria

  •      Operational Mode

  •      Conflict Resolution

  •      Assumptions

  •      Challenges with FCFS Scheduling

  •      Gantt Chart

  •      % CPU Idleness and Efficiency

e. HRRN

f. LRTF

g. Round Robin and Performance Discussion

h. Priority Based Scheduling

i. Multilevel Queue Feedback Scheduling

4.

Process Synchronization / Coordination

  • IPC and Introduction To Synchronization

  • Exploring Race Condition

  • Producer and Consumer Problem Implementation

  • Which type of Sync in Producer & Consumer Problem ?

  • Necessary Conditions for Sync Problems

  • Requirements for Sync Problems

  • Introduction to Sync Mechanism

  • Lock Variable - 1

  • Lock Variable - 2

  • Lock Variable - 3

  • Strict Alternation ( Turn Variable )

  • Implementation of Peterson Solution

  • Analysis Of Peterson Solution

  • Homework Question Discussion

  • Dekker's Algorithm

  • Introduction to Hardware Solutions

  • Test & Set Lock

  • SWAP - Lock and Key

  • Priority Inversion Problem

  • Priority Inversion Problem

  • Solution of Homework Problem

  • Blocking Mechanisms / Non Busy Wait Solution

  • Sleep & Wakeup

  • Producer - Consumer Interesting Case

  • Semaphores

  • Counting Semaphores

  • Binary Semaphores

  • What about ME, Progress and BW ?

  • Let's Solve Some Problems

  • Some More Questions

  • Some More : )

  • Producer Consumer - Semaphore Implementation

  • Some Practice Problems

  • Reader Writer Problem ( Semaphore )

  • Dining Philosophers Problem

  • Parbegin and Parend

  • Semaphore Solution

  • Question Practice

  • Fork & Join

5. Deadlock :

  • What's Deadlock ?

  • Resource Allocation Graph

  • Deadlock Handling Strategies

  • Resource Allocation Graph Algorithm

  • Bankers Algorithm

  • Problem Solving on Bankers Algorithm

  • Resource Request Algorithm

  • Problem Solving

  • Deadlock Detection

  • Deadlock Recovery

  • Problem Solving


6. Memory Management

  • Byte and Word Addressable View

  • RAM Architecture

  • Static Vs Dynamic Loading

  • Static Linking

  • Dynamic Linking and Address Binding

  • More about Binding

  • Memory Management Techniques

  • Partition Allocation Policy & Variable Partitioning

  • Problem Solving

  • Some More Problems

  • Non Contiguous Allocation

  • Address Translation

  • Simple Paging ( Org. of Logical Address Space )

  • Organization of Physical Address Space

  • Organization Of Memory Management Unit

  • How Paging Works ?

  • Problem Solving

  • Performance of Paging

  • Paging Using Cache

  • Optimal Page Size

  • Problem Solving

  • Don't Approximate Here

  • Hashed Paging

  • Multilevel Paging

  • How It's Helpful ?

  • Addressing In Multilevel Paging

  • Effective Memory Access Time

  • Problem Solving

  • Segmentation

  • Performance Analysis

  • Virtual Memory

  • Demand Paging

  • Everything in one Flowchart

  • Problem Solving

  • Page Replacement

  • Reference Strings and Page Repl. Algos

  • Belady's Anomaly

  • Page Replacement Algorithms

  • PRA Continued + Problem Solving

  • Thrashing

  • The way we write affect thrashing ?

  • Working Set Model and Locality Of References


7. File Management


  • Disk Structure

  • Problem Solving

  • More Problems

  • Logical Structure Of The Disk

  • File Vs Directory

  • File System Implementation

  • Allocation Methods

  • Case Studies

  • Problem Solving

  • Disk Free Space Management Algorithm

  • Problem Solving

  • More Problems

  • Disk Scheduling Algorithms

  • Problem Solving