Operating Systems ( OS ) (English)

   Friday, November 17, 2023   

Starting a new Lecture Notes Series on Operating Systems ( OS )

Youtube Lecture Playlist Credits 

Channel Name: Education 4u

So Let Us Start to This Journey of Learning 

Operating Systems ( OS ) By Lecture Notes together!

Lecture Description of this above Topic:

Lecture 1: Operating System tutorial for beginners | Lec-1

Lecture 2: Serial Processing System | OS | Lec-2

Lecture 3: Simple Batch System | OS | Lec-3

Lecture 4: Multiprogramming batch system | OS | Lec-4

Lecture 5: Parallel Systems | OS | Lec-5

Lecture 6: Distributed Systems | OS | Lec-6

Lecture 7: Parallel Systems vs Distributed Systems | OS | Lec-7

Lecture 8: Time sharing system | OS | Lec-8

Lecture 9: Personal Computing system | OS | Lec-9

Lecture 10: Real time operating system | Hard & soft | OS | Lec-10

Lecture 11: Memory Hierarchy | OS | Lec-11

Lecture 12: Memory Organization | OS | Lec-12

Lecture 13: Memory Management | OS | Lec-13

Lecture 14: Contigous vs Non Contiguous | Memory allocation | OS | Lec-14

Lecture 15: ixed Partitioning | Contiguous memory management | OS | Lec-15

Lecture 16: Dynamic Partitioning | Contiguous Memory Management | OS | Lec-16

Lecture 17: Fragmentation | Internal & External | OS | Lec-17

Lecture 18: Swapping | Memory | OS | Lec-18

Lecture 19: Paging | Memory Organisation | Part -1/2 | Operating Systems | Lec-19

Lecture 20: Paging | Memory Organisation | Part -2/2 | Operating Systems | Lec-20

Lecture 21: Virtual Memory | OS | Lec-21

Lecture 22: Demand paging | Introduction | OS | Lec-22

Lecture 23: Demand Paging | Performance | OS | Lec-23

Lecture 24: Page fault | How to handle | OS | Lec-24

Lecture 25: Page replacement | Introduction | OS | Lec-25

Lecture 26: Page replacement Algorithms | FIFO | Example | OS | Lec-26

Lecture 27: Page replacement Algorithms | LRU | Example | OS | Lec-27

Lecture 28: Page replacement Algorithms | OPTIMAL | Example | OS | Lec-28

Lecture 29: Segmentation | Introduction | OS | Lec-29

Lecture 30: Segmentation architecture | Example | OS | Lec-30

Lecture 31: Segmentation | Hardware & with Paging | OS | Lec-31

Lecture 32: Logical vs Physical address space | OS | Lec-32

Lecture 33: Memory Management unit | OS | Lec-33

Lecture 34: What is thrashing | OS | Lec-34

Lecture 35: Process in operating system | Lec-35

Lecture 36: Process State | OS | Lec-36

Lecture 37: Process Control Block | OS | Lec-37

Lecture 38: Inter Process Communication | Introduction | Part-1/2 | OS | Lec-38

Lecture 39: Inter Process Communication | Models & Mechanisms | Part-2/2 | OS | Lec-39

Lecture 40: What is a thread | Process vs Thread | OS | Lec-40

Lecture 41: Thread life cycle | States | OS | Lec-41

Lecture 42: single threading and multithreading | operating systems

Lecture 43: User level thread | Types of thread | OS | Lec-43

Lecture 44: Kernel level thread | Types of thread | OS | Lec-44

Lecture 45: Multi threading models | Many to One & One to One | Part -1/2 | OS | Lec-45

Lecture 46: Multi threading models | Many to Many | Part -2/2 | OS | Lec-46

Lecture 47: CPU Scheduling | Processor | OS | Lec-47

Lecture 48: Scheduling Criteria | OS | Lec-48

Lecture 49: FCFS scheduling Algorithm | Example | OS | Lec-49

Lecture 50: SJF scheduling algorithm | Example | OS | Lec-50

Lecture 51: Priority scheduling Algorithm | Example | OS | Lec-51

Lecture 52: Round Robin scheduling Algorithm | Example | OS | Lec-52

Lecture 53: Hardware Synchronisation | Test and Set | OS | Lec-53

Lecture 54: Process Synchronisation | Critical Section Problem | OS | Lec-54

Lecture 55: Critical Section problem Solution | OS | Lec-55

Lecture 56: Semaphore | Counting & Binary | OS | Lec-56

Lecture 57: Semaphore implementation | OS | Lec-57

Lecture 58: Bounded buffer Problem | Using Semaphore | OS | Lec-58

Lecture 59: Reader and Writer problem | Using Semaphore | OS | Lec-59

Lecture 60: Dinning Philosophers problem | Part-1/2 | OS | Lec-60

Lecture 61: Dinning Philosophers problem | Part-2/2 | OS | Lec-61

Lecture 62: Sleeping barber problem | OS | Lec-62

Lecture 63: What is deadlock | Necessary Conditions | OS | Lec-63

Lecture 64: Deadlock handling Methods | Deadlock Ignorance | OS | Lec-64

Lecture 65: Deadlock handling Methods | Deadlock Prevention | OS | Lec-65

Lecture 66: Deadlock handling Methods | Deadlock Avoidance | OS | Lec-66

Lecture 67: Resource allocation Graph | Example | OS | Lec-67

Lecture 68: Resource allocation Graph | With & Without deadlock | OS | Lec-68

Lecture 69: Disk management | OS | Operating System | Lec-69

Lecture 70: Disk scheduling | Introduction | OS | Lec-70

Lecture 71: FCFS disk scheduling Algorithm | Example | OS | Lec-71

Lecture 72: SSTF disk scheduling Algorithm | Example | OS | Lec-72

Lecture 73: SCAN disk scheduling algorithm | Example | OS | Lec-73

Lecture 74: CSCAN disk scheduling algorithm | Example | OS | Lec-74

Lecture 75: LOOK & CLOOK disk scheduling Algorithms | Example | OS | Lec-75