Memory Management 6. Memory Management Devise an example with 8 physical pages and 16 virtual pages and 10 page faults / references. Show how the pages are paged in / out (make assumption on the page replacement algorithm you use). The following picture shows an example with 8 physical pages and 16 virtual pages, with 8 page faults. Note with 10 page faults asked in this question, with 10 > 8, the # of physical pages, some physical page(s) will be paged out. Virtual address space 60K-64K X 56K-60K X Virtual page 52K-56K X 48K-52K X 44K-48K 7 40K-44K X 36K-40K 5 32K-36K X 28K-32K X 24K-28K X 20K-24K 3 16K-20K 4 12K-16K 0 8K-12K 6 4K-8K 1 OK-4K 2 Physical memory address 28K-32K 24K-28K 20K-24K 16K-20K 12K-16K 8K-12K 4K-8K OK-4K Page frame

Write a C program to Implement the Indexed allocation strategy.

Im working with R code.

cache.xls (or it can be a google sheet that you share with me in a cache.txt with the url in it )= a spreadsheet showing the cycle counts of a cached and non-cached machine. Also, you need to show the cache as the memory accesses progress in your program marking the hits and misses (misses in RED). You should have cells to show how many hits and how many misses your program has, and details on what is the cache replacement policy you implemented.   Here is code:   void c_cache_for_badge() {    int na = 8, nb = -3, nc = 10;    // pointers    int *npa;      npa = (int*)malloc(sizeof(int)*84);      // init integer pointers    for(int i = 0; i < 84; i++)    {        npa[i] = i;    }        // integer pointers    for(int i = 9; i < 70; i= i + 3)    {        nb += npa[i % 5] + npa[i % 3] + npa[i % 6];    }     }   void main() {    c_cache_for_badge(); }

1. Use Mergesort (Algorithm 2.2 and 2.4) to sort the following list. Show the actions step by step. Show merge function but skip the detail. 150 34 189 56 123 12 9 240 2. Show the detailed steps for Partition (in Quicksort) at the top level given the following list, similar to the example discussed in the class. 150 34 189 56 123 12 9 240

Most systems allow programs to allocate more memory to its address space during execution. Data allocated in the heap segments of programs is an example of such allocated memory. What is required to support dynamic memory allocation in the following schemes: a. contiguous-memory allocation b. pure segmentation c. pure paging

correct answer is 13. Can you explain by sperately please?

Question 16 Rk.use python  Full explain this question and text typing work only     We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line