Operating System (Hindi)

   Tuesday, September 29, 2020   

Starting a new Lecture Notes Series on Operating System

Youtube Lecture Playlist Credits: 

Channel Name: Easy Engineering Classes

So Let Us Start to This Journey of Learning 

Operating System By Lecture Notes together!

Click Here!

 

Lecture Description of this above Topic:

Lecture 1: Memory Management Introduction | Functions | Goals | Need and Definition of Fence Address

Lecture 2: Base & Limit Register | Dynamic Loading Vs. Linking | Logical Vs. Physical Address space| MMU

Lecture 3: Swapping | Roll Out – Roll In | Memory Management Techniques (Contiguous Vs. Non-Contiguous)

Lecture 4: Partitioning | M.F.T | Allocation Policies (First, Best, Worst, Next Fit) | Numerical on Allocation

Lecture 5: M.F.T Analysis | External and Internal Fragmentation with Example

Lecture 6: Multiprogramming with Variable Tasks(MVT) with Analysis of Fragmentation

Lecture 7: PAGING Introduction | Hardware Architecture of Paging - Operating System Classes for IP University

Lecture 8: Paging with Translation LookAside Buffer(TLB) | Complete Architecture Diagram

Lecture 9: Memory Protection in Paging | Protection Bits | Valid – Invalid Bit

Lecture 10: Virtual Memory Introduction | Advantages | User View | System View

Lecture 11: Demand Paging | Advantages | Disadvantages | Page Fault | Effective Memory Access Time

Lecture 12: Page Replacement Introduction | Graph of Page Fault vs. No. of Frames

Lecture 13: FIFO Page Replacement Algorithm with Example | Belady’s Anomaly Explanation

Lecture 14: Optimal Page Replacement Algorithm with Example

Lecture 15: LRU (Least Recently Used) Replacement Algorithm with Example

Lecture 16: Thrashing Problem in Operating System - OS Video Lectures for IPU, UPTU

Lecture 17: First Come First Serve(FCFS) Algorithm with Solved Example

Lecture 18: Shortest Seek Time First(SSTF) Algorithm with Solved Example

Lecture 19: SCAN and C-SCAN Algorithm with Solved Example

Lecture 20: LOOK and C-LOOK Algorithm with Solved Example

Lecture 21: CPU Scheduling Introduction | Types of Algorithm | Scheduling Criteria

Lecture 22: First Come First Serve(FCFS) CPU Scheduling Algorithm with Solved Example

Lecture 23: Shortest Job First(SJF) | Shortest Remaining Time(SRT) Algorithm with Solved Example

Lecture 24: Priority CPU Scheduling Algorithm with Solved Example

Lecture 25: Round Robin(RR) CPU Scheduling Algorithm with Solved Example

Lecture 26: Deadlock | Necessary Condition for Deadlock | Resource Allocation Graph

Lecture 27: Deadlock Avoidance | Banker’s Algorithm | Request Resource & Safety Algorithm

Lecture 28: Banker’s Algorithm Solved Example to Find Safe Sequence

Lecture 29: Banker’s Algorithm Solved Example to Allocate Resources to a Process and Check for Safe Sequence

Lecture 30: Process Synchronization Introduction | RACE Condition | Problem in Cooperating Process

Lecture 31: Critical Section Problem | Solution Criteria – Mutual Exclusion, Progress and Bounded Waiting

Lecture 32: Two Process Solution | 3 Different Solutions (Turn, Flag, Peterson’s Solution) with Explanation

Lecture 33: Semaphores | Wait, Signal Operation | Counting, Binary Semaphore | Busy Waiting, Example

Lecture 34: Producer Consumer Problem | Complete Solution with Semaphore

Lecture 35: Reader’s Writer Problem | Complete Solution with Semaphore

Lecture 36: Dining Philosopher’s Problem with Explanation

Lecture 37: Process Management Introduction | Program Vs. Process | Process State Diagram

Lecture 38: Process Control Block(PCB) | User and System(Kernel) Modes of Execution

Lecture 39: Process Switching | Scheduling Queue (Job, Ready, Device) | Long, Short, Medium Term Scheduler

Lecture 40: Services (System Calls) for Process Management | Creating, Termination, FORK/JOIN, ABORT etc.

Lecture 41: Single, Multithreaded Process, benefits| Multithreading Models

Lecture 42: Protection & Security Introduction | Goals of Protection | Domains of Protection

Lecture 43: Access Matrix to Implement Protection Model

Lecture 44: Levels of Security, Various Authentication Methods

Lecture 45: Program Threats (Trapdoors), System Threats (Worms, Virus)

Lecture 46: Threat Monitoring (Firewall) and Technique of Encryption

Lecture 47: File System Management Introduction | File Attributes and File Operations

Lecture 48: Open File Table | File Locking | Various File Types with Extension

Lecture 49: File Access Methods | Sequential, Direct and Indexed Access

Lecture 50: File Allocation Methods | Contiguous, Dynamic Storage, Linked and Indexed Allocation

Lecture 51: Free Space Management | Free Space List Implementation using Bit-Vector and Link Approach

Lecture 52: File Directories | Single-Level, Two Level, Tree Structural and Acyclic Graph Directories

Lecture 53: Deadlock Handling Strategies and Deadlock Prevention

Lecture 54: Deadlock Avoidance with Resource Allocation Graph(Example)

Lecture 55: Segmentation, H/W Support Diagram and Solved Numerical Example

Lecture 56: Segmentation with Paging, H/W Support Diagram and Solved Example

Lecture 57: Important Solved Numerical Problems on Shortest Job First(SJF) CPU Scheduling Algorithm

Lecture 58: Important Solved Numerical Problems on Shortest Remaining Time(SRT) CPU Scheduling Algorithm

Lecture 59: Important Solved Numerical Problems on First Come First Serve(FCFS) CPU Scheduling Algorithm

Lecture 60: Important Solved Numerical Problems on Round Robin CPU Scheduling Algorithm

Lecture 61: Important Solved Numerical Problems on Priority Based CPU Scheduling Algorithm

Lecture 62: Important Solved Numerical Problems on Page Replacement Algorithm (Problem 1)

Lecture 63: Important Solved Numerical Problems on Page Replacement Algorithm (Problem 2)

Lecture 64: Important Solved Numerical Problems on Disk Scheduling Algorithm (Problem 1)

Lecture 65: Important Solved Numerical Problems on Disk Scheduling Algorithm (Problem 2)