Главная
Study mode:
on
1
Lec-0: Operating System Syllabus Discussion for all College/University & Compititve exams (GATE,NET)
2
L-1.1: Introduction to Operating System and its Functions with English Subtitles
3
L-1.2: Batch Operating System | Types of Operating System
4
L-1.3: Multiprogramming and Multitasking Operating System in Hindi with real life examples
5
L-1.4: Types of OS(Real Time OS, Distributed, Clustered & Embedded OS)
6
L-1.5: Process States in Operating System| Schedulers(Long term,Short term,Medium term)
7
L-1.6: Imp Linux Commands(Operating System) | Must Watch for College/University & Competitive exams
8
L-1.7: System Calls in Operating system and its types in Hindi
9
L-1.8: Fork System call with Example | Fork() system call questions
10
L-1.9: Questions on Fork System Call With Explanation | Operating System
11
L-1.10: User mode and Kernel mode in operating system in hindi
12
L-1.11: Process Vs Threads in Operating System
13
L-1.12: User Level Vs Kernel Level Thread in Operating System | All Imp Points
14
L-2.1: Process Scheduling Algorithms (Preemption Vs Non-Preemption) | CPU Scheduling in OS
15
L-2.2: What is Arrival, Burst, Completion, Turnaround, Waiting and Response time in CPU Scheduling
16
L-2.3: First Come First Serve(FCFS) CPU Scheduling Algorithm with Example
17
L-2.4: Shortest Job First(SJF) Scheduling Algorithm with Example | Operating System
18
L-2.5: Shortest Remaining Time First (SJF With Preemption) Scheduling Algorithm with Example | OS
19
L-2.6: Question on Shortest Job First(SJF) with Preemption Scheduling Algorithm
20
L-2.7: Round Robin(RR) CPU Scheduling Algorithm with Example
21
L-2.8: Pre-emptive Priority Scheduling Algorithm with Example | Operating System
22
L-2.9: Example of Mix Burst Time(CPU & I/O both) in CPU Scheduling | Tough Question
23
L-2.10: Multi Level Queue Scheduling | Operating System
24
L-2.11: Multilevel Feedback Queue Scheduling | Operating System
25
L-3.1: Process Synchronization | Process Types | Race Condition | Operating System-1
26
L-3.2: Producer Consumer Problem | Process Synchronization Problem in Operating System
27
L-3.3: Printer-Spooler Problem | Process Synchronization Problem in Operating System
28
L-3.4: Critical Section Problem | Mutual Exclusion, Progress and Bounded Waiting | Operating System
29
L-3.5: LOCK Variable in OS | Process Synchronization
30
L-3.6: Test and Set Instruction in OS | Process Synchronization
31
L-3.7: Turn Variable | Strict Alteration Method | Process Synchronization
32
L-3.8: Semaphores | Wait, Signal Operation | Counting Semaphore | Example| Operating system
33
L-3.9: What is Binary Semaphore | Easiest Explanation | Operating system
34
L-3.10: Practice Question on Binary Semaphore in Operating System
35
L-3.11: Solution of Producer Consumer Problem using Semaphore | Operating System
36
L-3.12: Solution of Readers-writers Problem using Binary semaphore
37
L-3.13: Dining philosophers Problem and Solution using Semaphore in Operating System
38
L-4.1: DEADLOCK concept | Example | Necessary condition | Operating System
39
L-4.2: Resource Allocation Graph in Deadlock | Single Instance with example | Operating System
40
L-4.3: Multi-Instance Resource Allocation Graph with Example | Operating System
41
L-4.4: Deadlock Handling Methods and Deadlock Prevention | Operating System
42
L-4.5: Deadlock Avoidance Banker's Algorithm with Example |With English Subtitles
43
L-4.6: GATE 2018 Question on Banker's Algorithm | Deadlock avoidance | Operating Sytem
44
L-4.7: Question Explaination on Deadlock | Operating System
45
L-4.8: GATE 2018 Question Explaination on deadlock | Operating system
46
L-5.1: Memory Management and Degree of Multiprogramming | Operating System
47
L-5.2: Memory management Techniques | Contigious and non-Contigious | Operating System
48
L-5.3: Internal Fragmentation | Fixed size Partitioning | Memory management | Operating System
49
L-5.4: Variable size Partitioning | Memory management | Operating System
50
L-5.5: First Fit, Next Fit, Best Fit, Worst fit Memory Allocation | Memory Management | OS
51
L-5.6: GATE Question Solved on First Fit,Best Fit and Worst fit Memory Allocation | Operating System
52
L-5.7: GATE 2007 Question Solved on First Fit,Best Fit and Worst fit with timeline |Operating System
53
L-5.8: Need of Paging | Memory Management | Operating System
54
L-5.9: What is Paging | Memory management | Operating System
55
L-5.10: Question Explanation on Logical address and Physical address space | Operating System
56
L-5.11: Question Explanation on Paging | Memory Management | Operating System
57
L-5.12: Page Table Entries | Format of Page Table | Operating System
58
L-5.13: 2-Level Paging in Operating System | Multilevel Paging
59
L-5.14: Inverted paging | Memory Management | Operating System
60
L-5.15: Paging Questions in Operating System(OS) | Imp Question for all competitive exams
61
L-5.16: What is Thrashing | Operating System
62
L-5.17: Segmentation Vs Paging | Segmentation Working | Operating system
63
L-5.18: Overlay | Memory Management | Operating system
64
L-5.19: Virtual Memory | Page fault | Significance of virtual memory | Operating System
65
L-5.20: Translation Lookaside Buffer(TLB) in Operating System in Hindi
66
L-5.21: Numerical on Translation Lookaside Buffer (TLB) | Operating System
67
L-5.22: Page Replacement Introduction | FIFO Page Replacement algorithm | Operating System
68
L-5.23: Belady's Anomaly in FIFO page Replacement with example | Operating System
69
L-5.24: Optimal Page Replacement algorithm | Operating System
70
L-5.25: Least Recently Used Page Replacement Algorithm | Operating System
71
L-5.26: Most recently used page replacement algorithm | Operating System
72
L-6.1: Hard Disk Architecture in Operating System in Hindi
73
L-6.2: Disk Access Time with Example | Seek Time, Rotational Time and Transfer Time
74
L-6.3: Disk Scheduling Algorithm | Operating System
75
L-6.4: FCFS in Disk scheduling with Example | Operating System
76
L-6.5: SSTF in Disk scheduling with Example | Operating System
77
L-6.6: SCAN Algorithm in Disk scheduling with Example | Operating System
78
L-6.7: LOOK Algorithm in Disk scheduling with Example | Operating System
79
L-6.8: C-SCAN Algorithm in Disk scheduling with Example | Operating System
80
L-6.9: C-LOOK Algorithm in Disk scheduling with Example | Operating System
81
L-6.10: Imp Qus. on Operating System | Must Watch | NTA NET June 2021
82
L-7.1: File System in Operating System | Windows, Linux, Unix, Android etc.
83
L-7.2: File Attributes & Operations in Operating System
84
L-7.3: Allocation Methods in operating system in hindi | Contiguous vs NonContiguous
85
L-7.4: Contiguous Allocation in Operating system | Advantages & Disadvantages
86
L-7.5: Linked List allocation in file allocation with example | Operating system
87
L-7.6: Indexed File Allocation in Operating System
88
L-7.7: Unix Inode Structure with Numerical Example | OS
89
Lec-8: Protection & Security in Operating system | Full OS playlist
90
TLBs Toughest Question asked in GATE exam | Operating System
Description:
Explore a comprehensive 20-hour course on operating systems covering fundamental concepts, advanced topics, and practical applications. Learn about various types of operating systems, process management, scheduling algorithms, synchronization, deadlock handling, memory management, disk scheduling, and file systems. Dive into key topics like system calls, CPU scheduling, process synchronization problems, deadlock prevention and avoidance, paging, virtual memory, and disk architecture. Gain hands-on experience with Linux commands and solve real-world problems through numerous examples and practice questions. Prepare for college exams, competitive exams like GATE and NET, and enhance your understanding of operating system principles and implementations across different platforms including Windows, Linux, Unix, and Android.
Operating System
Add to list
#Computer Science
#Operating Systems
#Memory Management
#Artificial Intelligence
#Computer Vision
#Image Processing
#Segmentation
#Deadlocks
0:00 / 0:00
1 of 90