all are in the question

QUESTION 2: (15 Marks) a) Consider a Segmentation based virtual memory system that has the following segment table (Table 1). For each of the following logical addresses (Segment number, offset) determine the equivalent physical address or indicate if a segment fault occurs if any. 1. 0,298 11.1.143 111.2,420 IV.3,786 V.4.222 Sega Start Address Site 0 10 300 300 1500 2 800 400 3 1200 800 14 2000 200 Table-1 (5 Marks) b) A l-Mbyte block of memory is allocated using the buddy system. 1. Show the results of the following sequence of memory allocation and deallocation as shown in following sample figure-l: memory blocks request sequence: Request- A(20K), Request-B(75K), Request-C(180K). Request- D(80K), and Request-E(140K) memory blocks release sequence returns Return-E, Return-D, Return-C, Return- B, and return-A. (5 Marks) 3 30 11 1 D IM Figure-1 II. Show the binary tree representation for the sequence given in Q-2(B)-I. (5 Marks) QUESTION 2: (15 Marks) a) Consider a Segmentation based virtual memory system that has the following segment table (Table 1). For each of the following logical addresses (Segment number, offset) determine the equivalent physical address or indicate if a segment fault occurs if any. 1. 0,298 11.1.143 111.2,420 IV.3,786 V.4.222 Sega Start Address Site 0 10 300 300 1500 2 800 400 3 1200 800 14 2000 200 Table-1 (5 Marks) b) A l-Mbyte block of memory is allocated using the buddy system. 1. Show the results of the following sequence of memory allocation and deallocation as shown in following sample figure-l: memory blocks request sequence: Request- A(20K), Request-B(75K), Request-C(180K). Request- D(80K), and Request-E(140K) memory blocks release sequence returns Return-E, Return-D, Return-C, Return- B, and return-A. (5 Marks) 3 30 11 1 D IM Figure-1 II. Show the binary tree representation for the sequence given in Q-2(B)-I