Introduction
  • Introduction
  • Important Tip
Introduction to Operating Systems
  • Introduction to Computer Systems
  • How hardware devices work together
  • Need for Operating Systems from scratch
  • How Input and Output devices work together
Operating System Concepts
  • Program vs Process, States of a process
  • Degree of Multiprogramming
  • Types of Operating Systems
  • An Important point to note
  • Process Control block, Attributes of a process
CPU Scheduling Algorithms - SJF, SRTF, FCFS
  • Types of scheduler, Context switching
  • Various times of a process
  • Types of Scheduling Algorithms
  • SJF Scheduling Algorithm
  • SJF Example 1
  • SJF Example 2
  • Shortest Remaining Time First Scheduling Algorithm
  • Response time explained with example
  • SRTF assignment problem
  • SRTF assignment problem solution
  • Response Time example 2
  • SRTF assignment problem 2
  • SRTF assignment problem 2 solution
  • First Come First Served Scheduling Algorithm
  • FCFS with Context Switching overhead
Comparision of FCFS, SJF and SRTF - Advantages and Disadvantages
  • Starvation
  • Convoy Effect
  • Practical Implementation
  • Throughput
CPU Scheduling Algorithms - LJF, LRTF, Priority-based, HRRN
  • Longest Job First Scheduling Algorithm
  • LJF Example 1
  • Longest Remaining Time First Scheduling Algorithm
  • LRTF Example 1
  • LRTF Example 2
  • LRTF Example 2 continuation
  • Round Robin Scheduling Algorithm
  • RR Example 1
  • RR Example 2
  • RR Important Observations
  • Advantages and Limitations of RR Algorithm
  • Non Preemptive Priority based Scheduling Algorithm
  • Preemptive Priority based Scheduling Algorithm
  • Preemptive Priority based Scheduling Algorithm Continuation
  • SRTF with processes requiring CPU and IO time 2
  • Priority based scheduling with processes requiring CPU and IO time
  • Highest Response Ratio Next Scheduling Algorithm
  • HRRN Example
  • Process State Diagram
  • Suspend Ready State and Suspend IO state
  • Dispatcher
Basics of Number System
  • Basics of Binary Numbers
  • Basics of Binary Numbers
Memory Allocation Techniques
  • Basics of Memory Allocation
  • Contiguous Allocation vs Non Contiguous Allocation
  • Fixed Partitioning
  • Variable Partitioning
  • Memory Allocation Algorithms
  • Problem
  • Problem continued
  • Important point to note
  • Problem
  • Binary addressing revisited
  • Example to explain binary addressing concepts
  • Need for paging
Bonus : How to proceed further
  • Bonus : What to do next