Operating System - Part 21 - Semaphores: Binary & Counting Semaphores

Part-1: Introduction to Operating system: Part-2: What is Operating system and Goals of OS Part-3: Dual Mode Operation. Part-4: Loader and Linker Part-5: Types of loaders: Compile and Go loader Part-6: Types of Loaders: Simple Loader or General Loader Part-7: Types of loaders: Absolute Loader and Bootstrap Loader Part-8: Types of loaders: Relocatable/Relative/Reallocation loader Part-9: Introduction to process management Part-10: Differences between process and program Part-11: Process State Diagram Part-12: CPU Scheduling and Scheduling Criteria's Part-13: First Come First Serve scheduling algorithm Part-14: Shortest Job First scheduling algorithm Part-15: Priority schduling algorithm Part-16: Round robin schduling algorithm Part-17: Introduction to process synchronization Part-18: Critical Section Problem: Mutual exclusion, Progress, bounded waiting Part-19: Peterson's Solution Part-20: Synchronization Hardware: TestandSet & Swap Questions answered in this video are: 1) what is process 2) what is synchronization 3) what is process synchronization 4) what is race condition 5) what is co-operative process 6) peterson's solution 7) advantages of peterson's solution 8) disadvantages of peterson's solution 9) general structure of any co-operative process which uses software solution 10) general structure of any co-operative process which uses hardware solution 11) lock 12) while loop working 13) what is atomic instructions 14) What is non-atomic instructions 15) Disadvantages of hardware solution 16) Software solution 17) What is semaphores 18) Types of semaphores 19) Explanation of binary semaphore with code 20) Explanation of counting semaphores with code 21) Explanation of binary semaphore with real time example 22) Explanation of counting semaphore with real time example 23)