Operating Systems from scratch

Vignesh Sekar

Play Speed
  • 0.5x
  • 1x (Normal)
  • 1.25x
  • 1.5x
  • 2x
57 Videos (7h 37m)
    • Introduction

      2:48
    • Useful Tips

      2:01
    • Introduction to Computer Systems

      11:05
    • How hardware devices work together

      6:25
    • Need for Operating Systems from scratch

      8:34
    • How Input and Output devices work together

      16:35
    • Program vs Process , States of a process

      9:24
    • Degree of Multiprogramming

      5:29
    • Types of Operating Systems

      11:54
    • An Important point to note

      1:31
    • Process Control Block

      8:15
    • Attributes of a process

      14:13
    • Types of scheduler, Context switching

      11:23
    • Various times of a process

      11:28
    • Types of Scheduling Algorithms

      8:37
    • SJF Scheduling Algorithm

      9:21
    • SJF Example 1

      9:18
    • SJF Example 2

      5:57
    • Shortest Remaining Time First Scheduling Algorithm

      15:39
    • Response time explained with example

      13:43
    • SRTF assignment problem solution

      5:23
    • Response Time example 2

      1:20
    • SRTF assignment problem 2 solution

      4:54
    • First Come First Served Scheduling Algorithm

      7:18
    • FCFS with Context Switching overhead

      9:59
    • Comparision of FCFS, SJF and SRTF - Advantages and Disadvantages - Starvation

      13:06
    • Comparision of FCFS, SJF and SRTF - Advantages and Disadvantages - Convoy effect

      10:34
    • Comparision of FCFS, SJF and SRTF - Advantages and Disadvantages - Throughput

      15:07
    • Comparision of FCFS, SJF and SRTF - Advantages and Disadvantages - Practical implementation

      2:43
    • Longest Job First Scheduling Algorithm

      6:25
    • LJF Example 1

      5:17
    • Longest Remaining Time First Scheduling Algorithm

      2:12
    • LRTF Example 1

      5:03
    • LRTF Example 2

      3:09
    • LRTF Example 2 continuation

      2:41
    • Round Robin Scheduling Algorithm

      3:46
    • RR Example 1

      10:34
    • RR Example 2

      5:40
    • RR Important Observations

      2:54
    • Advantages and Limitations of RR Algorithm

      4:58
    • Non Preemptive Priority based Scheduling Algorithm

      8:14
    • Preemptive Priority based Scheduling Algorithm

      4:37
    • Preemptive Priority based Scheduling Algorithm Continuation

      3:32
    • SRTF with processes requiring CPU and IO time

      12:27
    • SRTF with processes requiring CPU and IO time 2

      12:27
    • Priority based scheduling with processes requiring CPU and IO time

      8:13
    • Highest Response Ratio Next Scheduling Algorithm

      8:34
    • HRRN Example

      6:17
    • Process State Diagram

      9:41
    • Suspend Ready State and Suspend IO state

      9:14
    • Dispatcher

      3:54
    • Basics of Binary Numbers

      12:45
    • Basics of Memory Allocation

      12:33
    • Contigious Allocation vs Non Contigious Allocation

      5:40
    • Fixed Partitioning

      9:59
    • Variable Partitioning

      10:25
    • Memory Allocation Algorithms

      12:02

About This Class

Mastering the concepts of Operating Systems is very important to get started with Computer Science because Operating Systems is the program which is responsible for the ease with which we are able to use computers today.
In this course ,every concept of Operating Systems is taught in an easy-to-understand manner such that anybody without any prerequisites will be able to master the concepts in the easiest way.

Come and join me, I assure you that you will have the best learning experience of not just Operating Systems but also the core of Computer Science in a different dimension.