|
Introduction to Operating Systems
|
|
|
|
Lecture 1: Introduction to Operating Systems | What is OS and Why we need it ?
86:00
|
|
|
|
Annotated Notes Lecture 1
(39 pages)
|
|
|
|
Lecture 2a: How Operating System create a new process | Process Control Block
79:00
|
|
|
|
Lecture 2b: Forking the Identical Copies | GATE 2005 very nice question | Bit about logical address
115:00
|
|
|
|
Annotated Notes Lecture 2
(94 pages)
|
|
|
|
Lecture 3: Fork Questions | Process Graph | Fork Tree
92:00
|
|
|
|
Annotated Notes Lecture 3
(62 pages)
|
|
|
|
Lecture 4 exec | Creating a Process | System Calls
105:00
|
|
|
|
Annotated Notes Lecture 4
(52 pages)
|
|
|
|
Lecture 5 System Call Execution | Threads
108:00
|
|
|
|
Annotated Notes Lecture 5
(66 pages)
|
|
|
|
Lecture 6: User Level Threads and Kernel Level Threads | Threads
|
|
|
|
Annotated Notes Lecture 6
(77 pages)
|
|
|
|
Lecture 7: Thread Mapping models, and Context Switching
77:00
|
|
|
|
Annotated Notes Lecture 7
(65 pages)
|
|
|
|
Must Watch Marathon: Summary So Far
|
|
|
|
Lecture 8 : Process State Diagram and Schedulers
96:00
|
|
|
|
Annotated Notes Lecture 8
(37 pages)
|
|
|
|
Lecture 9 : Scheduling Algorithms: FCFS
|
|
|
|
Annotated Notes Lecture 9
(26 pages)
|
|
|
|
Lecture 10 : Scheduling Algorithms: Shortest Job First (SJF)
|
|
|
|
Annotated Notes Lecture 10
(65 pages)
|
|
|
|
Lecture 11 : Scheduling Algorithms: Round Robin
|
|
|
|
Annotated Notes Lecture 11
(68 pages)
|
|
|
|
Lecture 12 : Scheduling Algorithms: SRTF
|
|
|
|
Annotated Notes Lecture 12
(66 pages)
|
|
|
|
Lecture 13 : Scheduling Algorithms: Priority Scheduling
|
|
|
|
Annotated Notes Lecture 13
(55 pages)
|
|
|
|
Lecture 14 : InterProcess Communication (IPC)
69:00
|
|
|
|
Annotated Notes Lecture 14
(26 pages)
|
|
|
|
Lecture 15: Introduction to Synchronisation
|
|
|
|
Annotated Notes Lecture 15
(34 pages)
|
|
|
|
Lecture 16: Critical Section Solution Requirements
94:00
|
|
|
|
Annotated Notes Lecture 16
(78 pages)
|
|
|
|
Lecture 17: Questions on Critical Section Solution Requirements
|
|
|
|
Annotated Notes Lecture 17
(55 pages)
|
|
|
|
Lecture 18: Peterson's solution and Hardware Solutions
|
|
|
|
Annotated Notes Lecture 18
(43 pages)
|
|
|
|
Lecture 19: Atomic Hardware Instructions and Semaphores
|
|
|
|
Annotated Notes Lecture 19
(99 pages)
|
|
|
|
Revision Session
|
|
|
|
Lecture 20: Semaphores PYQs
135:00
|
|
|
|
Annotated Notes Lecture 20
(79 pages)
|
|
|
|
Lecture 21 Classic Synchronisation Problems: Producer Consumer, Reader Writer
129:00
|
|
|
|
Annotated Notes Lecture 21
(91 pages)
|
|
|
|
Lecture 22 Classic Synchronisation Problems: Reader Writer, Dining Philosophers
89:00
|
|
|
|
Annotated Notes Lecture 22
(59 pages)
|
|
|
|
Please Rate us to help us
|
|
|
|
A Journey of the Program | The Big Picture | Compiler, Linker, Assembler, and Loader.
|
|
|
|
Lecture 23 Memory Management 1: Base Bound Registers, Segmentation
|
|
|
|
Annotated Notes Lecture 23
(65 pages)
|
|
|
|
[Optional] Lecture 24 Questions on Base Bound Registers, Segmentation
|
|
|
|
Annotated Notes Lecture 24
(55 pages)
|
|
|
|
Lecture 25: Introduction to Paging
|
|
|
|
Annotated Notes Lecture 25
(100 pages)
|
|
|
|
Lecture 26:Single level Paging questions
|
|
|
|
Annotated Notes Lecture 26
(94 pages)
|
|
|
|
Lecture 27: Multi Level Paging
|
|
|
|
Annotated Notes Lecture 27
(62 pages)
|
|
|
|
Lecture 28: Multi Level Paging -2
110:00
|
|
|
|
Annotated Notes Lecture 28
(64 pages)
|
|
|
|
Lecture 29: Multi Level Paging -3 (Reducing Page Table Size)
156:00
|
|
|
|
Annotated Notes Lecture 29
(94 pages)
|
|
|
|
Lecture 30: Memory Management Summary So Far, and Hashed, Inverted Page Tables
|
|
|
|
Annotated Notes Lecture 30 Multilevel Paging Revision, Hashed, and Inverted Page Table
(130 pages)
|
|
|
|
Lecture 31: Segmentation with Paging
|
|
|
|
Annotated Notes Lecture 31 Segmentation with Paging
(39 pages)
|
|
|
|
Lecture 32: Demand Paging and Page replacement Algorithms
|
|
|
|
Annotated Notes Lecture 32 Demand Paging and Page replacement Algorithms
(125 pages)
|
|
|
|
Lecture 33: Remaining Topics in Memory Management: Translation Lookaside Buffer, Dynamic Allocation Strategies
|
|
|
|
GATE 2020 TLB Page Fault Question
28:00
|
|
|
|
Annotated Notes GATE 2020 Question
(6 pages)
|
|
|
|
Annotated Notes Lecture 33 TLB, Dynamic Allocation Strategies
(90 pages)
|
|
|
|
Please Rate us on course page
|
|
|
|
Lecture 34: Deadlock in Operating Systems
|
|
|
|
Annotated Notes Lecture 34 Deadlock in OS
(96 pages)
|
|
|
|
Lecture 35: Deadlock Avoidance (Banker's Algorithm), Detection & Recovery
|
|
|
|
Annotated Notes Lecture 35 Deadlock Avoidance, Detection & Recovery
(78 pages)
|
|
|
File Systems
|
|
|
|
File System Implementation
153:00
|
|
|
|
Practice questions and PYQs in File System Implementation
108:00
|
|
|
|
File System Annotated Notes
(165 pages)
|
|
|
|
Feedback of the course
|
|
|
OS PYQs Series
|
|
|
|
Youtube Lectures on PYQs
|
|
|
Students' Hand Written Notes
|
|
|
|
Handwritten Notes by Karan Agrawal (AIR 102 GATE CS 2024) - Operating System
|
|
|
|
Notes by Quantum City (AIR 107, GATE CS 2024, Shreyas Rathod) - Operating Systems Notes
(54 pages)
|
|