|
Introduction
|
|
|
|
Introduction to Operating System and its Functions
|
Preview
|
|
Process Concept
|
|
|
|
Process vs Program
18:00
|
Preview
|
|
|
Process State Diagram - Explanation
|
Preview
|
|
|
Process State Diagram
(5 pages)
|
|
|
|
Book Reading: Process States - Galvin & William Stallings
116:00
|
|
|
|
EXTRA: MCQ'S ON PROCESS STATE DIAGRAM
58:00
|
|
|
CPU Scheduling
|
|
|
|
Multitasking Vs Multiprogramming Vs Multiprocessing
11:00
|
|
|
|
Necessity & Types of Process Scheduling
18:00
|
|
|
|
Criteria For Scheduling Algorithms
16:00
|
|
|
|
Classification of Scheduling Algorithms
18:00
|
|
|
|
FCFS Scheduling Algorithm
|
|
|
|
Advantages and Disadvantages of FCFS
12:00
|
|
|
|
LIVE LECTUTRE: Problems on FCFS
58:00
|
|
|
|
SJF & SRTF Algorithms
|
|
|
|
Live Lecture : Numerical on SJF & SRTN
69:00
|
|
|
|
Advantage Disadvantages of SJF
7:00
|
|
|
|
Live Lecture: Numerical on SJF and SRTN/SRTF
60:00
|
|
|
|
Static Prediction Techniques
5:00
|
|
|
|
Dynamic Prediction techniques: Simple & Exponential Averaging
|
|
|
|
Priority Scheduling Algorithm
|
|
|
|
Highest Response Ratio Next(HRRN) Algorithm
|
|
|
|
Live Lecture Prority and HRRN
45:00
|
|
|
|
Round Robin Scheduling Algorithm
21:00
|
|
|
|
Multilevel Queue & Multilevel Feedback Queue Scheduling Algorithm
21:00
|
|
|
|
Live Lecture: Gate Problems Based on Round Robin Scheduling
73:00
|
|
|
|
Scheduling Theory pdf
(10 pages)
|
|
|
Deadlocks
|
|
|
|
Necessary Conditions For Deadlock
|
|
|
|
Types of Resources | Maximum Number of Resources For Deadlock To Occur
|
|
|
|
Resource Allocation Graph
|
|
|
|
Techniques For Deadlock Handling
|
|
|
|
Deadlock Prevention Techniques
|
|
|
|
Concept of Safe & Unsafe State
13:00
|
|
|
|
Deadlock Avoidance For Single Instance Resource Type
13:00
|
|
|
|
Banker's Algorithm
|
|
|
Synchronization
|
|
|
|
Introduction To Process Synchronization
|
|
|
|
Concept of progress, bounded waiting & mutual exclusion
|
|
|
|
Process Synchronization Through A Lock Variable | Busy Waiting Solution
22:00
|
|
|
|
Busy Waiting Solution: Turn Variable | Strict Variable
|
|
|
|
Busy Waiting Solution: Interested Variable
|
|
|
|
Busy Waiting Solution: Peterson's Solution
|
|
|
|
Interrupt Method
21:00
|
|
|
|
Test and Set Hardware Instruction
18:00
|
|
|
|
Compare and Swap
8:00
|
|
|
|
Mutex Lock
24:00
|
|
|
|
Concept of Semaphore
19:00
|
|
|
|
MCQ's on Semaphore : Part 1
59:00
|
|
|
|
MCQ's on Semaphore : Part 2
64:00
|
|
|
|
Producer-Consumer Problem
34:00
|
|
|
|
Live Lecture: Dining philosopher
54:00
|
|
|
|
Live Lecture: Readers-Writers Problem
36:00
|
|
|
|
Issues With Semaphores
15:00
|
|
|
|
MCQ'S on Classical Synchronization Problems
55:00
|
|
|
Memory-Management Strategies
|
|
|
|
Contagious memory allocation
25:00
|
|
|
|
Allocation strategy
13:00
|
|
|
|
MCQ'S On Allocation Strategies
59:00
|
|
|
|
Binary Math's Behind Paging
97:00
|
|
|
|
Galvin book reading
61:00
|
|
|
|
Concept of Address Binding
29:00
|
|
|
|
Concept of Memory Protection
16:00
|
|
|
|
Concept of Page and Frame
|
|
|
|
Concept of paging
20:00
|
|
|
|
Live Lecture : Numerical on Paging | Part 1
76:00
|
|
|
|
Live Lecture : Numerical on Paging | Part 2
38:00
|
|
|
|
Live Lecture: Binary Math's Behind Multilevel Paging
|
|
|
|
Live Lecture : Numerical on Paging | Part 3
50:00
|
|
|
|
Galvin Book Reading : Hardware Support For Paging| concept of valid invalid bits
46:00
|
|
|
|
Galvin Book Reading : TLB Concept
63:00
|
|
|
|
Test on paging 1
|
|
|
|
paging test 1 discussion
39:00
|
|
|
|
Paging Test 2
|
|
|
|
paging test 2 discussion
52:00
|
|
|
|
Concept of Page Sharing
11:00
|
|
|
|
Effective Memory Access Time in TLB cache
|
|
|
|
optimal page size
13:00
|
|
|
|
Need of Multilevel Paging
18:00
|
|
|
|
Concept of Hashed Page Table
13:00
|
|
|
|
Concept of Inverted Page Table
16:00
|
|
|
|
Numerical on TLB
44:00
|
|
|
|
memory management concepts
(21 pages)
|
|
|
Virtual-Memory Management
|
|
|
|
Concept of Virtual Memory
19:00
|
|
|
|
EMAT in Demand Paging
27:00
|
|
|
|
FIFO Page Replacement Algorithm
20:00
|
|
|
|
Belady's Anomaly
18:00
|
|
|
|
Optimal Page Replacement Algorithm
6:00
|
|
|
|
LRU Page Replacement Algorithm
6:00
|
|
|
|
Concept of virtual Memory
(22 pages)
|
|
|
Mass-Storage Structure & I/O System
|
|
|
|
Structure of Disk
|
|
|
|
FCFS Disk Scheduling
|
|
|
|
SSTF Disk Scheduling
|
|
|
|
SCAN, LOOK, C SCAN, C LOOK Disk Scheduling
|
|
|
File System
|
|
|
|
Directory Implementation & File Allocation Strategy
(9 pages)
|
|