Computer Science > QUESTIONS & ANSWERS > Questions and Answers > Victoria University NIT1202 OPERATING SYTEM ASSSIGNMENT 2. (All)

Questions and Answers > Victoria University NIT1202 OPERATING SYTEM ASSSIGNMENT 2.

Document Content and Description Below

a. Use the best-fit algorithm to indicate which memory blocks are allocated to each of the four arriving jobs. Under the best fit algorithm,  Job A is allocated to the block 3.  Job B is all ... ocated to the block 1.  Job C is allocated to the block 4.  Job D is allocated to the block 2. b. Use the first-fit algorithm to indicate which memory blocks are allocated to each of the four arriving jobs. Under the first fit algorithm,  Job A is allocated to the block 1  Job B is allocated to the block 2.  Job C is allocated to the block 3.  Job D will not allocated because it memory size is greater than the memory blocks available, so it waits. [2 + 2 = 4 marks] 2. If a program has 571 bytes and will be loaded into page frames of 100 bytes each, and the instruction to be used is at byte 132, answer the following questions: a. How many pages are needed to store the entire job? Job size= 571 Page frame=100 No of pages = job size/ page frame =571/100 =5.71 So the total no of pages will be 6. And the pages are P0, P1, P2, P3, P4 and P5. Job List: Job Number Memory Requested Job A 77K Job B 900K Job C 54K Job D 801K Memory Block List: Memory Block Memory Block Size Block 1 900K Block 2 910K Block 3 200K Block 4 300K b. Compute the page number and exact displacement for each of the byte addresses where the data is stored. (Remember that page numbering starts at zero). 132th byte lies in the 1st Page with 32 displacement . To access 132th byte, Byte address=132/100. So, the quotient 1 give the page number. P1 would contain the 132th byte. P0 0 0*100+0 [Show More]

Last updated: 3 years ago

Preview 1 out of 7 pages

Buy Now

Instant download

We Accept: