Complete Operating System in one shot | Semester Exam | Hindi

➡ Contact Us: 👇
📞Call on: [phone]

➡ One Shot Complete Playlist for GATE CSE Exam : 👇

➡ Our One Shot Semester Exam Videos: 👇

#knowledgegate #sanchitsir #sanchitjain

*********************************************************
Content in this video:
00:00 (Chapter-0: Introduction)- About this video

02:42 (Chapter-1: Introduction)- Operating system, Goal & functions, System Components, Classification of Operating systems- Batch, Spooling, Multiprogramming, Multiuser/Time sharing, Multiprocessor Systems, Real-Time Systems.

34:20 (Chapter-2: Operating System Structure)- Layered structure, Monolithic and Microkernel Systems, Interface, System Call.

52:20 Chapter-3: Process Basics)- What is Process, Process Control Block (PCB), Process identification information, Process States, Process Transition Diagram, Schedulers, CPU Bound and i/o Bound, Context Switch.

1:09:58 (Chapter-4: CPU Scheduling)- Scheduling Performance Criteria, Scheduling Algorithms.

1:53:41 (Chapter-5: Process Synchronization)- Race Condition, Critical Section Problem, Mutual Exclusion, Peterson’s solution, Process Concept, Principle of Concurrency,

2:21:00 (Chapter 6: Semaphores)- Basics of Semaphores, Classical Problem in Concurrency- Producer/Consumer Problem, Reader-Writer Problem, Dining Philosopher Problem, Sleeping Barber Problem, Test and Set operation.

3:04:37 (Chapter-7: Deadlock)- Deadlock characterization, Prevention, Avoidance and detection, Recovery from deadlock, Ignorance.

3:49:39 (Chapter-8)- Fork Command, Multithreaded Systems, Threads, and their management

4:01:18 (Chapter-9: Memory Management)- Memory Hierarchy, Locality of reference, Multiprogramming with fixed partitions, Multiprogramming with variable partitions, Protection schemes, Paging, Segmentation, Paged segmentation.

5:06:23 (Chapter-10: Virtual memory)- Demand paging, Performance of demand paging, Page replacement algorithms, Thrashing.

5:28:22 (Chapter-11: Disk Management)- Disk Basics, Disk storage and disk scheduling, Total Transfer time.

6:01:15 (Chapter-12: File System)- File allocation Methods, Free-space Management, File organization and access mechanism, File directories, and File sharing, File system implementation issues, File system protection and security.

[Sidhartha-wd]

00:01 Complete operating system in one video
02:00 The operating system acts as an intermediate between the user and the hardware.
06:14 Understanding the primary and secondary goals of an operating system
08:28 Operating system components and batch processing in brief
12:53 Combination of input and output devices resulted in slow processing.
15:14 Multiprogramming allows multiple processes to be loaded into memory and execute them efficiently.
19:23 CPU performs multiple tasks simultaneously through time sharing or multitasking.
21:21 Time sharing and multitasking is the logical extension of multi programming.
25:21 Scheduling on specific processor only
27:29 Real-time operating system is designed to handle specific conditions within a defined time frame.
31:57 Distributed operating system allows for reliable and fault-tolerant resource sharing
33:56 Operating System structure and approach
37:54 Operating System - a technical name for micro Karnal approach
40:02 Microkernel approach in operating systems
44:07 Operating system has a graphical interface with icons and pointers.
46:15 System calls in operating systems facilitate communication between user programs and the operating system.
50:16 Transition from user mode to kernel mode
52:11 Process is the execution of a program
55:55 Understanding the basic components of a process
57:50 Operating system process life cycle and states
1:01:35 Operating systems have three types of schedules: long term, middle term, and short term.
1:03:45 Middle term schedule helps manage processes temporarily and improves system efficiency.
1:07:53 CPU bound process and input output process
1:09:51 CPU Scheduling is an important topic in Operating Systems.
1:13:47 The key criteria in judging algorithms for operating systems include execution time and CPU utilization.
1:15:38 Weighted Round Robin is a better algorithm for minimizing waiting time.
1:19:20 First Come First Serve (FCFS) is a simple approach to process scheduling.
1:21:11 Understanding the completion time and turn around time in an operating system.
1:25:07 Convoy effect causes waiting time in scheduling
1:26:50 The video explains the concept of executing smaller processes first.
1:30:30 Understanding the process of switching between processes based on time remaining
1:32:25 Operating system scheduling algorithms - Primitive version and Priority Algorithm
1:36:03 The scheduling algorithm for processes in an operating system is based on priority.
1:38:01 Retirement is for one unit till 18
1:42:09 Time sharing in operating systems is achieved through a technique called Round Robin scheduling.
1:43:54 Circular queue is used in round-robin scheduling algorithm
1:47:54 Round robin is a time sharing system with client-server architecture.
1:49:57 Multi-level scheduling is a concept where different types of processes are given priority and managed accordingly.
1:53:48 Operating system handles multiple processes efficiently
1:55:38 Understanding race conditions and its impact on process execution.
1:59:20 Mutual exclusion is important in critical areas
2:01:08 Operating system processes in critical areas and their impact on efficiency
2:04:53 Understanding the concept of turning the variable into two
2:06:44 P1's movements and control in the critical area
2:10:35 Operating system concepts explained with examples
2:12:37 Progress in operating system is achieved by avoiding deadlocks and ensuring processes can switch
2:16:32 Understanding the concept of mutual exclusion in operating systems
2:18:17 Implementing Peterson's Solution for Mutual Exclusion
2:22:08 Process synchronization and atomic operations in operating systems
2:24:07 Understanding the concept of critical sections in operating systems
2:27:49 Understanding the concept of bonded weight and its elimination through Seema Four Way Solution.
2:29:48 Producer and consumer have different responsibilities and should avoid accessing the buffer at the same time.
2:33:41 Weight operation determines if the consumer can go inside
2:35:46 Reader-writer problem in operating system
2:39:58 Mutex helps synchronize between two readers for efficient reading.
2:42:11 Understanding the mechanism of readers and writers
2:46:10 Operating System Chopstick Problem Solution
2:48:44 Solutions to make the system safer from deadlock
2:52:28 Managing waiting customers and limited resources
2:54:17 Handling mutex and signaling after a wet operation
2:57:50 Understanding the concept of locks in operating systems
2:59:45 Understanding Test and Set basic testing
3:03:23 Understanding deadlock in computer science
3:05:07 Processes in an operating system can get deadlocked if they are waiting for resources that are held by other processes
3:09:21 Understanding the necessary conditions for deadlock prevention
3:11:17 Mutual exclusive and Hall and Wait are key concepts of operating system
3:15:19 Mutual Exclusion, Hold and Wait, No Preemption, Circular Wait are the four conditions to avoid deadlock.
3:17:13 Prevention is key to avoiding deadlock in operating systems.
3:20:49 The protocol states that you should only take the resources you need.
3:22:33 Handling Deadlocks in Operating Systems
3:26:12 Order of resource allocation
5:31:02 Complete Operating System in one shot for Semester Exam

[gursaveksingh]

00:01 Complete operating system in one video
02:00 The operating system acts as an intermediate between the user and the hardware.
06:14 Understanding the primary and secondary goals of an operating system
08:28 Operating system components and batch processing in brief
12:53 Combination of input and output devices resulted in slow processing.
15:14 Multiprogramming allows multiple processes to be loaded into memory and execute them efficiently.
19:23 CPU performs multiple tasks simultaneously through time sharing or multitasking.
21:21 Time sharing and multitasking is the logical extension of multi programming.
25:21 Scheduling on specific processor only
27:29 Real-time operating system is designed to handle specific conditions within a defined time frame.
31:57 Distributed operating system allows for reliable and fault-tolerant resource sharing
33:56 Operating System structure and approach
37:54 Operating System - a technical name for micro Karnal approach
40:02 Microkernel approach in operating systems
44:07 Operating system has a graphical interface with icons and pointers.
46:15 System calls in operating systems facilitate communication between user programs and the operating system.
50:16 Transition from user mode to kernel mode
52:11 Process is the execution of a program
55:55 Understanding the basic components of a process
57:50 Operating system process life cycle and states
1:01:35 Operating systems have three types of schedules: long term, middle term, and short term.
1:03:45 Middle term schedule helps manage processes temporarily and improves system efficiency.
1:07:53 CPU bound process and input output process
1:09:51 CPU Scheduling is an important topic in Operating Systems.
1:13:47 The key criteria in judging algorithms for operating systems include execution time and CPU utilization.
1:15:38 Weighted Round Robin is a better algorithm for minimizing waiting time.
1:19:20 First Come First Serve (FCFS) is a simple approach to process scheduling.
1:21:11 Understanding the completion time and turn around time in an operating system.
1:25:07 Convoy effect causes waiting time in scheduling
1:26:50 The video explains the concept of executing smaller processes first.
1:30:30 Understanding the process of switching between processes based on time remaining
1:32:25 Operating system scheduling algorithms - Primitive version and Priority Algorithm
1:36:03 The scheduling algorithm for processes in an operating system is based on priority.
1:38:01 Retirement is for one unit till 18
1:42:09 Time sharing in operating systems is achieved through a technique called Round Robin scheduling.
1:43:54 Circular queue is used in round-robin scheduling algorithm
1:47:54 Round robin is a time sharing system with client-server architecture.
1:49:57 Multi-level scheduling is a concept where different types of processes are given priority and managed accordingly.
1:53:48 Operating system handles multiple processes efficiently
1:55:38 Understanding race conditions and its impact on process execution.
1:59:20 Mutual exclusion is important in critical areas
2:01:08 Operating system processes in critical areas and their impact on efficiency
2:04:53 Understanding the concept of turning the variable into two
2:06:44 P1's movements and control in the critical area
2:10:35 Operating system concepts explained with examples
2:12:37 Progress in operating system is achieved by avoiding deadlocks and ensuring processes can switch
2:16:32 Understanding the concept of mutual exclusion in operating systems
2:18:17 Implementing Peterson's Solution for Mutual Exclusion
2:22:08 Process synchronization and atomic operations in operating systems
2:24:07 Understanding the concept of critical sections in operating systems
2:27:49 Understanding the concept of bonded weight and its elimination through Seema Four Way Solution.
2:29:48 Producer and consumer have different responsibilities and should avoid accessing the buffer at the same time.
2:33:41 Weight operation determines if the consumer can go inside
2:35:46 Reader-writer problem in operating system
2:39:58 Mutex helps synchronize between two readers for efficient reading.
2:42:11 Understanding the mechanism of readers and writers
2:46:10 Operating System Chopstick Problem Solution
2:48:44 Solutions to make the system safer from deadlock
2:52:28 Managing waiting customers and limited resources
2:54:17 Handling mutex and signaling after a wet operation
2:57:50 Understanding the concept of locks in operating systems
2:59:45 Understanding Test and Set basic testing
3:03:23 Understanding deadlock in computer science
3:05:07 Processes in an operating system can get deadlocked if they are waiting for resources that are held by other processes
3:09:21 Understanding the necessary conditions for deadlock prevention
3:11:17 Mutual exclusive and Hall and Wait are key concepts of operating system
3:15:19 Mutual Exclusion, Hold and Wait, No Preemption, Circular Wait are the four conditions to avoid deadlock.
3:17:13 Prevention is key to avoiding deadlock in operating systems.
3:20:49 The protocol states that you should only take the resources you need.
3:22:33 Handling Deadlocks in Operating Systems
3:26:12 Order of resource allocation
5:31:02 Complete Operating System in one shot for S

[NimishSomani]

00:01 Complete operating system in one video
02:00 The operating system acts as an intermediate between the user and the hardware.
06:14 Understanding the primary and secondary goals of an operating system
08:28 Operating system components and batch processing in brief
12:53 Combination of input and output devices resulted in slow processing.
15:14 Multiprogramming allows multiple processes to be loaded into memory and execute them efficiently.
19:23 CPU performs multiple tasks simultaneously through time sharing or multitasking.
21:21 Time sharing and multitasking is the logical extension of multi programming.
25:21 Scheduling on specific processor only
27:29 Real-time operating system is designed to handle specific conditions within a defined time frame.
31:57 Distributed operating system allows for reliable and fault-tolerant resource sharing
33:56 Operating System structure and approach
37:54 Operating System - a technical name for micro Karnal approach
40:02 Microkernel approach in operating systems
44:07 Operating system has a graphical interface with icons and pointers.
46:15 System calls in operating systems facilitate communication between user programs and the operating system.
50:16 Transition from user mode to kernel mode
52:11 Process is the execution of a program
55:55 Understanding the basic components of a process
57:50 Operating system process life cycle and states
1:01:35 Operating systems have three types of schedules: long term, middle term, and short term.
1:03:45 Middle term schedule helps manage processes temporarily and improves system efficiency.
1:07:53 CPU bound process and input output process
1:09:51 CPU Scheduling is an important topic in Operating Systems.
1:13:47 The key criteria in judging algorithms for operating systems include execution time and CPU utilization.
1:15:38 Weighted Round Robin is a better algorithm for minimizing waiting time.
1:19:20 First Come First Serve (FCFS) is a simple approach to process scheduling.
1:21:11 Understanding the completion time and turn around time in an operating system.
1:25:07 Convoy effect causes waiting time in scheduling
1:26:50 The video explains the concept of executing smaller processes first.
1:30:30 Understanding the process of switching between processes based on time remaining
1:32:25 Operating system scheduling algorithms - Primitive version and Priority Algorithm
1:36:03 The scheduling algorithm for processes in an operating system is based on priority.
1:38:01 Retirement is for one unit till 18
1:42:09 Time sharing in operating systems is achieved through a technique called Round Robin scheduling.
1:43:54 Circular queue is used in round-robin scheduling algorithm
1:47:54 Round robin is a time sharing system with client-server architecture.
1:49:57 Multi-level scheduling is a concept where different types of processes are given priority and managed accordingly.
1:53:48 Operating system handles multiple processes efficiently
1:55:38 Understanding race conditions and its impact on process execution.
1:59:20 Mutual exclusion is important in critical areas
2:01:08 Operating system processes in critical areas and their impact on efficiency
2:04:53 Understanding the concept of turning the variable into two
2:06:44 P1's movements and control in the critical area
2:10:35 Operating system concepts explained with examples
2:12:37 Progress in operating system is achieved by avoiding deadlocks and ensuring processes can switch
2:16:32 Understanding the concept of mutual exclusion in operating systems
2:18:17 Implementing Peterson's Solution for Mutual Exclusion
2:22:08 Process synchronization and atomic operations in operating systems
2:24:07 Understanding the concept of critical sections in operating systems
2:27:49 Understanding the concept of bonded weight and its elimination through Seema Four Way Solution.
2:29:48 Producer and consumer have different responsibilities and should avoid accessing the buffer at the same time.
2:33:41 Weight operation determines if the consumer can go inside
2:35:46 Reader-writer problem in operating system
2:39:58 Mutex helps synchronize between two readers for efficient reading.
2:42:11 Understanding the mechanism of readers and writers
2:46:10 Operating System Chopstick Problem Solution
2:48:44 Solutions to make the system safer from deadlock
2:52:28 Managing waiting customers and limited resources
2:54:17 Handling mutex and signaling after a wet operation
2:57:50 Understanding the concept of locks in operating systems
2:59:45 Understanding Test and Set basic testing
3:03:23 Understanding deadlock in computer science
3:05:07 Processes in an operating system can get deadlocked if they are waiting for resources that are held by other processes
3:09:21 Understanding the necessary conditions for deadlock prevention
3:11:17 Mutual exclusive and Hall and Wait are key concepts of operating system
3:15:19 Mutual Exclusion, Hold and Wait, No Preemption, Circular Wait are the four conditions to avoid deadlock.
3:17:13 Prevention is key to avoiding deadlock in operating systems.
3:20:49 The protocol states that you should only take the resources you need.
3:22:33 Handling Deadlocks in Operating Systems
3:26:12 Order of resource allocation
5:31:02 Complete Operating System in one shot for Semester Exam

[adarshrathore]

sjf 1:32:00
priority scheduling 1:40:41
round robin 1:47:46
Memory Partitioning 4:26:29
Paging Working in short 4:41:35
Page Replecement Algorithms 5:17:04

[Google.clouds]

00:00 (Chapter-0: Introduction)- About this video

02:42 (Chapter-1: Introduction)- Operating system, Goal & functions, System Components, Classification of Operating systems- Batch, Spooling, Multiprogramming, Multiuser/Time sharing, Multiprocessor Systems, Real-Time Systems.

34:20 (Chapter-2: Operating System Structure)- Layered structure, Monolithic and Microkernel Systems, Interface, System Call.

52:20 Chapter-3: Process Basics)- What is Process, Process Control Block (PCB), Process identification information, Process States, Process Transition Diagram, Schedulers, CPU Bound and i/o Bound, Context Switch.

1:09:58 (Chapter-4: CPU Scheduling)- Scheduling Performance Criteria, Scheduling Algorithms.

1:53:41 (Chapter-5: Process Synchronization)- Race Condition, Critical Section Problem, Mutual Exclusion, Peterson’s solution, Process Concept, Principle of Concurrency,

2:21:00 (Chapter 6: Semaphores)- Basics of Semaphores, Classical Problem in Concurrency- Producer/Consumer Problem, Reader-Writer Problem, Dining Philosopher Problem, Sleeping Barber Problem, Test and Set operation.

3:04:37 (Chapter-7: Deadlock)- Deadlock characterization, Prevention, Avoidance and detection, Recovery from deadlock, Ignorance.

3:49:39 (Chapter-8)- Fork Command, Multithreaded Systems, Threads, and their management

4:01:18 (Chapter-9: Memory Management)- Memory Hierarchy, Locality of reference, Multiprogramming with fixed partitions, Multiprogramming with variable partitions, Protection schemes, Paging, Segmentation, Paged segmentation.

5:06:23 (Chapter-10: Virtual memory)- Demand paging, Performance of demand paging, Page replacement algorithms, Thrashing.

5:28:22 (Chapter-11: Disk Management)- Disk Basics, Disk storage and disk scheduling, Total Transfer time.

6:01:15 (Chapter-12: File System)- File allocation Methods, Free-space Management, File organization and access mechanism, File directories, and File sharing, File system implementation issues, File system protection and security.

[maneeshrockx]

Truly amazing video, I wish we had teachers like you in our school and colleges. India ab tak develop ho chuka hota.

[fazlomar]

Not much, just a token of appreciation sir, thanks a lot 😁

[cousinsvlogs]

Timestamps (Powered by Merlin AI)
00:01 - Complete operating system in one video
02:00 - The operating system acts as an intermediate between the user and the hardware.
06:14 - Understanding the primary and secondary goals of an operating system
08:28 - Operating system components and batch processing in brief
12:53 - Combination of input and output devices resulted in slow processing.
15:14 - Multiprogramming allows multiple processes to be loaded into memory and execute them efficiently.
19:23 - CPU performs multiple tasks simultaneously through time sharing or multitasking.
21:21 - Time sharing and multitasking is the logical extension of multi programming.
25:21 - Scheduling on specific processor only
27:29 - Real-time operating system is designed to handle specific conditions within a defined time frame.
31:57 - Distributed operating system allows for reliable and fault-tolerant resource sharing
33:56 - Operating System structure and approach
37:54 - Operating System - a technical name for micro Karnal approach
40:02 - Microkernel approach in operating systems
44:07 - Operating system has a graphical interface with icons and pointers.
46:15 - System calls in operating systems facilitate communication between user programs and the operating system.
50:16 - Transition from user mode to kernel mode
52:11 - Process is the execution of a program
55:55 - Understanding the basic components of a process
57:50 - Operating system process life cycle and states
1:01:35 - Operating systems have three types of schedules: long term, middle term, and short term.
1:03:45 - Middle term schedule helps manage processes temporarily and improves system efficiency.
1:07:53 - CPU bound process and input output process
1:09:51 - CPU Scheduling is an important topic in Operating Systems.
1:13:47 - The key criteria in judging algorithms for operating systems include execution time and CPU utilization.
1:15:38 - Weighted Round Robin is a better algorithm for minimizing waiting time.
1:19:20 - First Come First Serve (FCFS) is a simple approach to process scheduling.
1:21:11 - Understanding the completion time and turn around time in an operating system.
1:25:07 - Convoy effect causes waiting time in scheduling
1:26:50 - The video explains the concept of executing smaller processes first.
1:30:30 - Understanding the process of switching between processes based on time remaining
1:32:25 - Operating system scheduling algorithms - Primitive version and Priority Algorithm
1:36:03 - The scheduling algorithm for processes in an operating system is based on priority.
1:38:01 - Retirement is for one unit till 18
1:42:09 - Time sharing in operating systems is achieved through a technique called Round Robin scheduling.
1:43:54 - Circular queue is used in round-robin scheduling algorithm
1:47:54 - Round robin is a time sharing system with client-server architecture.
1:49:57 - Multi-level scheduling is a concept where different types of processes are given priority and managed accordingly.
1:53:48 - Operating system handles multiple processes efficiently
1:55:38 - Understanding race conditions and its impact on process execution.
1:59:20 - Mutual exclusion is important in critical areas
2:01:08 - Operating system processes in critical areas and their impact on efficiency
2:04:53 - Understanding the concept of turning the variable into two
2:06:44 - P1's movements and control in the critical area
2:10:35 - Operating system concepts explained with examples
2:12:37 - Progress in operating system is achieved by avoiding deadlocks and ensuring processes can switch
2:16:32 - Understanding the concept of mutual exclusion in operating systems
2:18:17 - Implementing Peterson's Solution for Mutual Exclusion
2:22:08 - Process synchronization and atomic operations in operating systems
2:24:07 - Understanding the concept of critical sections in operating systems
2:27:49 - Understanding the concept of bonded weight and its elimination through Seema Four Way Solution.
2:29:48 - Producer and consumer have different responsibilities and should avoid accessing the buffer at the same time.
2:33:41 - Weight operation determines if the consumer can go inside
2:35:46 - Reader-writer problem in operating system
2:39:58 - Mutex helps synchronize between two readers for efficient reading.
2:42:11 - Understanding the mechanism of readers and writers
2:46:10 - Operating System Chopstick Problem Solution
2:48:44 - Solutions to make the system safer from deadlock
2:52:28 - Managing waiting customers and limited resources
2:54:17 - Handling mutex and signaling after a wet operation
2:57:50 - Understanding the concept of locks in operating systems
2:59:45 - Understanding Test and Set basic testing
3:03:23 - Understanding deadlock in computer science
3:05:07 - Processes in an operating system can get deadlocked if they are waiting for resources that are held by other processes
3:09:21 - Understanding the necessary conditions for deadlock prevention
3:11:17 - Mutual exclusive and Hall and Wait are key concepts of operating system
3:15:19 - Mutual Exclusion, Hold and Wait, No Preemption, Circular Wait are the four conditions to avoid deadlock.
3:17:13 - Prevention is key to avoiding deadlock in operating systems.
3:20:49 - The protocol states that you should only take the resources you need.
3:22:33 - Handling Deadlocks in Operating Systems
3:26:12 - Order of resource allocation
5:31:02 - Complete Operating System in one shot for Semester Exam

[shreyamanitripathi]

The Best Lecture on the YouTube of Operating system.
Thank you Sir for the valuable explanation on this topic

[Expolrer_]

How many are from makaut before 5th sem exam??

[monikayadav-wbpu]

Complete operating system in one video
02:00 The operating system acts as an intermediate between the user and the hardware.
06:14 Understanding the primary and secondary goals of an operating system
08:28 Operating system components and batch processing in brief
12:53 Combination of input and output devices resulted in slow processing.
15:14 Multiprogramming allows multiple processes to be loaded into memory and execute them efficiently.
19:23 CPU performs multiple tasks simultaneously through time sharing or multitasking.
21:21 Time sharing and multitasking is the logical extension of multi programming.
25:21 Scheduling on specific processor only
27:29 Real-time operating system is designed to handle specific conditions within a defined time frame.
31:57 Distributed operating system allows for reliable and fault-tolerant resource sharing
33:56 Operating System structure and approach
37:54 Operating System - a technical name for micro Karnal approach
40:02 Microkernel approach in operating systems
44:07 Operating system has a graphical interface with icons and pointers.
46:15 System calls in operating systems facilitate communication between user programs and the operating system.
50:16 Transition from user mode to kernel mode
52:11 Process is the execution of a program
55:55 Understanding the basic components of a process
57:50 Operating system process life cycle and states
1:01:35 Operating systems have three types of schedules: long term, middle term, and short term.
1:03:45 Middle term schedule helps manage processes temporarily and improves system efficiency.
1:07:53 CPU bound process and input output process
1:09:51 CPU Scheduling is an important topic in Operating Systems.
1:13:47 The key criteria in judging algorithms for operating systems include execution time and CPU utilization.
1:15:38 Weighted Round Robin is a better algorithm for minimizing waiting time.
1:19:20 First Come First Serve (FCFS) is a simple approach to process scheduling.
1:21:11 Understanding the completion time and turn around time in an operating system.
1:25:07 Convoy effect causes waiting time in scheduling
1:26:50 The video explains the concept of executing smaller processes first.
1:30:30 Understanding the process of switching between processes based on time remaining
1:32:25 Operating system scheduling algorithms - Primitive version and Priority Algorithm
1:36:03 The scheduling algorithm for processes in an operating system is based on priority.
1:38:01 Retirement is for one unit till 18
1:42:09 Time sharing in operating systems is achieved through a technique called Round Robin scheduling.
1:43:54 Circular queue is used in round-robin scheduling algorithm
1:47:54 Round robin is a time sharing system with client-server architecture.
1:49:57 Multi-level scheduling is a concept where different types of processes are given priority and managed accordingly.
1:53:48 Operating system handles multiple processes efficiently
1:55:38 Understanding race conditions and its impact on process execution.
1:59:20 Mutual exclusion is important in critical areas
2:01:08 Operating system processes in critical areas and their impact on efficiency
2:04:53 Understanding the concept of turning the variable into two
2:06:44 P1's movements and control in the critical area
2:10:35 Operating system concepts explained with examples
2:12:37 Progress in operating system is achieved by avoiding deadlocks and ensuring processes can switch
2:16:32 Understanding the concept of mutual exclusion in operating systems
2:18:17 Implementing Peterson's Solution for Mutual Exclusion
2:22:08 Process synchronization and atomic operations in operating systems
2:24:07 Understanding the concept of critical sections in operating systems
2:27:49 Understanding the concept of bonded weight and its elimination through Seema Four Way Solution.
2:29:48 Producer and consumer have different responsibilities and should avoid accessing the buffer at the same time.
2:33:41 Weight operation determines if the consumer can go inside
2:35:46 Reader-writer problem in operating system
2:39:58 Mutex helps synchronize between two readers for efficient reading.
2:42:11 Understanding the mechanism of readers and writers
2:46:10 Operating System Chopstick Problem Solution
2:48:44 Solutions to make the system safer from deadlock
2:52:28 Managing waiting customers and limited resources
2:54:17 Handling mutex and signaling after a wet operation
2:57:50 Understanding the concept of locks in operating systems
2:59:45 Understanding Test and Set basic testing
3:03:23 Understanding deadlock in computer science
3:05:07 Processes in an operating system can get deadlocked if they are waiting for resources that are held by other processes
3:09:21 Understanding the necessary conditions for deadlock prevention
3:11:17 Mutual exclusive and Hall and Wait are key concepts of operating system
3:15:19 Mutual Exclusion, Hold and Wait, No Preemption, Circular Wait are the four conditions to avoid deadlock.
3:17:13 Prevention is key to avoiding deadlock in operating systems.
3:20:49 The protocol states that you should only take the resources you need.
3:22:33 Handling Deadlocks in Operating Systems
3:26:12 Order of resource allocation
5:31:02 Complete Operating System in one shot for S

[satishshingade]

Not every problem needs to be solved is a great lesson 😇

[BabaiRay-dydg]

Sir it will be very much beneficial if you please teach the subjects like Machine Learning, Cyber Security, Multimedia Systems etc for the semester exams.

[bytebytego-]

sjf 1:32:00
priority scheduling 1:40:41
round robin 1:47:46
Memory Partitioning 4:26:29
Paging Working in short 4:41:35
Page Replecement Algorithms 5:17:04
fifo page rep 5:18:07

[krateeshrajput]

Best vedio I have ever seen for OS we have our university exam on 7th of August (AKTU)❤️ thank you sir 🙏

[bholupandey]

BCA 3rd semester ke liye kaun padh kaun padh rha?🖐

[manowar]

4:51:36
Answer is
2.
SM= 4TB
MM=8GB
P=31
f = 22
Page size= 2KB

3.
LA= 39
MM= 2GB
P = 30
d = 9
f = 22
😊😊😊

[vishalraj]

It is my first time that i have watched a 6 hours long video completely without getting bored. Thankyou sir.

[notknown]

Sir sorry for inconvenience but i am a little confused in the last question regarding to the table you provided for paging problems . how do we calculate the value of d if the system is byte addressable or something else isn't given ?sir will we be assuming the system to be 1 byte addressable if not given or there is a way to compute it . kindly reply time stamp 4:51:59

[akankshasinghthakur]

Thank you sm my exam went awesome after preparing with this video great initiative ❤️❤️❤️❤️❤️❤️❤️❤️thank you sm