Assalam o Alikum Warehmatullah Paper Overview. Paper was much easier than expected. Most of the MCQs were repeated from: Moazz Files Waqar Files Junaid Files VUTOOLKIT (A lot of MCQs came from here) Subjective (Short Questions) 1. Critical Section Problem Write the name of the algorithm used to solve the Critical Section Problem. Answer: Bakery Algorithm 2. Data Structures Among Hash Table, Sequential Search, and Stack, which is the best technique? 3. First Fit Memory Allocation Find the First Fit for: (a) 12 KB (b) 10 KB (c) 9 KB Memory Blocks: 10 KB 4 KB 20 KB 18 KB 7 KB 9 KB 12 KB 15 KB Subjective (Long Questions) Most of the long questions were from the Masters File. 1. Deadlock Convert Resource Allocation Graph (RAG) to Wait-For Graph (WFG). Determine whether deadlock exists or