Summary
Keywords
Full Transcript
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 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) how simple lock system are used to solve critical section problem 14) what is atomic instructions 15) what is non-atomic instructions 16) 4 different hardware soliutions used to solve critical section problem 17) what is machine instruction 18) TestandSet atomic instruction 19) How TestandSet is used to solve critical section problem 20) explanation of TestandSet using code 21) how TestandSet achieves mutual exclusion and progress 22) swap atomic instruction 23) How Swap is used to solve critical section problem 24) explanation of swap using code 25) how Swap achieves mutual exclusion and progress
