1 - Introduction (21.32 MB)
10 - Process Creation Termination (146.14 MB)
11 - Interprocess Communication (44.92 MB)
12 - Pipes (80.02 MB)
13 - Process Synchronization Race Condition Critical Section (73.37 MB)
14 - Types of solutions to CS problem (108.9 MB)
15 - Semaphores (25 MB)
16 - BoundedBuffer ProducerConsumer Problem (73.06 MB)
17 - DiningPhilosophers Problem Monitors (28.32 MB)
18 - CPU Scheduling Criteria (28.42 MB)
19 - FIFO First In and First Out or FCFS (22.48 MB)
2 - Tasks performed by Operating System (22.72 MB)
20 - ShortestJobFirst SJF Scheduling (48.15 MB)
21 - Priority Scheduling (28.83 MB)
22 - Round Robin RR Scheduling Multilevel Queue Scheduling Multilevel Feedback (46.07 MB)
23 - Deadlocks ResourceAllocation Graph (67.27 MB)
24 - Deadlock Prevention Avoidance (31.09 MB)
25 - Bankers Algorithm (31.67 MB)
26 - Deadlock Detection Prevention Algorithm (36.6 MB)
27 - Basics of Memory Management (81.27 MB)
28 - Logical vs Physical Address Space (26.17 MB)
29 - CONTIGUOUS MEMORY ALLOCATION (48.78 MB)
3 - Role of Operating System (37.85 MB)
30 - Internal Fragmentation (32.12 MB)
31 - Partition Allocation Algorithm (19.36 MB)
32 - External Fragmentation (31.94 MB)
33 - Non Contiguous Allocation Paging (135.97 MB)
34 - Page Fault (16.62 MB)
35 - STRUCTURE OF A PAGE TABLE (31.92 MB)
36 - Segmentation (118.89 MB)
37 - Virtual Memory (86.43 MB)
38 - Demand Paging (44.86 MB)
39 - CopyonWrite (17.22 MB)
4 - The Evolution of Operating System (134.24 MB)
40 - FIFO Page replacement algorithms (29.14 MB)
41 - Optimal and LRU Page replacement algorithms (40.47 MB)
42 - COUNTING AND PAGE BUFFERING ALGORITHMS (28.3 MB)
43 - Allocation of Frames (53.13 MB)
44 - Thrashing (63.27 MB)
5 - Simple Batch Systems (75.67 MB)
6 - TimeSharing Systems (48.48 MB)
7 - MAJOR ACHIEVEMENTS (74.64 MB)
8 - Process (82.45 MB)
9 - Process Scheduling (77.11 MB)