Computer Science > QUESTIONS & ANSWERS > Victoria University NIT 2201 Assignment questions for Part 2 sant (All)

Victoria University NIT 2201 Assignment questions for Part 2 sant

Document Content and Description Below

Assignment questions for Part 2: Functionality of Memory and Processor 1. Given the following information: a. Use the best-fit algorithm to indicate which memory blocks are allocated to each of the ... four arriving jobs. ANSWER: For the best fit algorithm, Job allocates the smallest free partition which meets the requirement without wasting a lot of memory. So, Job A needs 77k so it will fit in any block of the four but it goes with Block 3 so that not much memory is wasted. Job B needs 900k block 1 but The block does not have large enough space to allocate this job. Job C also fits in block 4 Job D can fit in Block 1 and 2 but it fits in block 2 as block 1 is already used. Job Number Memory requested Memory block Memory block size A 77K Block 3 200K B 900K - - C 54K Block 4 300K D 801K Block 2 910K b. Use the first-fit algorithm to indicate which memory blocks are allocated to each of the four arriving jobs. Job number Memory requested Memory block Memory block size A 77K Block 1 900k B 900K - - C 54K Block 3 200k D 801K - - ANSWER: For the first fit algorithm, means to select the first block that meets the requirement. For Job A, it takes first block 1 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 This study source was downloaded by 100000793680026 from CourseHero.com on 06-07-2021 04:44:24 GMT -05:00 https://www.coursehero.com/file/64011254/Assignment-questions-for-Part-2-santdocx/ This study resource was shared via CourseHero.comJob B it takes block 2 but does not fit because The block does not have large enough space to allocate this job so it waits for Job A Job C it takes block 3 as per the requirement. Job D it takes Block 4 but does not fit so it has to wait for other blocks as Job A or Job C to finish which has free space and then fits. [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? ANSWER: There will be 6 pages.(page No.0-5) [Show More]

Last updated: 3 years ago

Preview 1 out of 7 pages

Buy Now

Instant download

We Accept: