Index
INDEX
2. Components of the Computer System
3.1. Mainframe Operating System
3.3. Multiprocessor Operating System
3.4. Personal Computer Operating System
3.5. Real-Time Operating System
3.6. Embedded Operating System
3.7. Smart Card Operating System
6. Operating System as Resource Manager
7. Operating System as Virtual Machine
13. Resource Sharing among Processes
14. Possibilities for Execution of Process
17. Process Control Block (PCB)
21. Differentiation between Thread and Process
22. Benefits of Multithreaded Programming
23.1 Implementation of Thread in User Space
23.2 Implementation of Thread in Kernel Space
23.3 Hybrid Implementation of Thread
24. Relationship between User Threads and Kernel Threads
25. Differentiate Process and Program
26. Differentiate between Multi-Programming and Multi-Threading
32. Advantages and Disadvantages of User Level Threads over Kernel Level Threads
33. Interprocess Communication
Models of Interprocess Communication
34. Problems with Interprocess Communication
37. Conditions to Avoid Race Condition
38. Implementation of Mutual Exclusion using Critical Regions
39. Mutual Exclusion with Busy Waiting
40. Disabling Interrupt for Mutual Exclusion
41. Lock Variable for Mutual Exclusion
42. Strict Alternation for Mutual Exclusion
43. Disabling Peterson’s Solution for Mutual Exclusion
44. Properties of Time Sharing Operating System
45. Types of Scheduling in Real Time Operating System
46. Scheduling in Hard Real Time Operating System
46.1 Rate Monotonic Scheduling of Hard Real Time Systems
46.2 Earliest Deadline First Scheduling of Hard Real Time Systems
46.3 Pthread Scheduling of Hard Real Time Systems
46.4 Proportional Share Scheduling of Hard Real Time Systems
47. Scheduling in Soft Real-Time Operating System
47.1 Priority Based Scheduling of Soft Real Time Systems
47.2 Preemptive Kernels Scheduling of Soft Real Time Systems
47.3 Minimizing Latency Scheduling of Soft Real Time Systems
48. Types of Multiprocessor System
49. Scheduling in Asymmetric Multiprocessor System
50. Scheduling in Symmetric Multiprocessor System
53. Producer-Consumer Problem with Bounded Buffer
55. Producer-Consumer Problem Using Semaphores
60.1 Dining Philosophers Problem
62. Classifications of Process
62.2 Input/Output Bound Process
65.1 Non-preemptive/Co-operative Scheduling
65.2 Preemptive/Non-co-operative Scheduling
67.1 First Come First Served (FCFS)
67.5 Multilevel Queue Scheduling
67.6 Multilevel Feedback Queue Scheduling
72.2 Non-Preempt Table Resource
75. Method for Handling Deadlock
78. Resource Allocation Graph Algorithm
81. Resource Request Algorithm
83. Deadlock Detection Algorithm
86. Difference between Logical and Physical Address Space
88. Dynamic Relocation Type Using a Relocation Register
91. Difference between Loading and Linking
100. Numerical Related to Logical and Physical Address
103. Page Replacement Algorithm
106. Numerical Solved By First In First Out Disk Scheduling
107. Optimization of First In First Out Disk Scheduling
109. Numerical For Belady’s Anomaly Problem
110. Optimal Page Replacement Algorithm
111. Numerical Solved by Optimal Page Replacement Algorithm
113. Least Recently Used Page Replacement Algorithm
114. Numerical Solved by Least Recently Used Page Replacement Algorithm