3. virtual memory pages Consider the following code and READ the instructions carefully: static int a[3000]; void f() { int small[100]; int i; int j; for (i = 0; i < 100; i++) small [i] = 0; for (i = 0; i < 30; i++) { } } for (j = 0; j < 100; j++) small[j] += a[i*100+j]; Assume pages are each 8K bytes. Also assume that the heap (where static data is stored) is more than 8K bytes away from the stack. Ignoring any memory used to hold the program instructions, what is the minimum number of pages of physical memory this function will need to not swap pages to disk? Briefly explain your answer (e.g., what is on each page).
3. virtual memory pages Consider the following code and READ the instructions carefully: static int a[3000]; void f() { int small[100]; int i; int j; for (i = 0; i < 100; i++) small [i] = 0; for (i = 0; i < 30; i++) { } } for (j = 0; j < 100; j++) small[j] += a[i*100+j]; Assume pages are each 8K bytes. Also assume that the heap (where static data is stored) is more than 8K bytes away from the stack. Ignoring any memory used to hold the program instructions, what is the minimum number of pages of physical memory this function will need to not swap pages to disk? Briefly explain your answer (e.g., what is on each page).
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
![3. virtual memory pages
Consider the following code and READ the instructions carefully:
static int a[3000];
void f()
{
int small[100];
int i;
int j;
for (i = 0; i < 100; i++)
small[i] = 0;
for (i = 0; i < 30; i++)
{
for (j = 0; j< 100; j++)
smallj] += a[i*100+j];
}
Assume pages are each 8K bytes. Also assume that the heap (where static data is
stored) is more than 8K bytes away from the stack.
Ignoring any memory used to hold the program instructions, what is the minimum
number of pages of physical memory this function will need to not swap pages to disk?
Briefly explain your answer (e.g., what is on each page).](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F234e95aa-3c9b-4409-a419-85021a7ac49b%2F000fbc4a-cfef-4414-979d-5ba17cdf840b%2Fm8pymkb_processed.png&w=3840&q=75)
Transcribed Image Text:3. virtual memory pages
Consider the following code and READ the instructions carefully:
static int a[3000];
void f()
{
int small[100];
int i;
int j;
for (i = 0; i < 100; i++)
small[i] = 0;
for (i = 0; i < 30; i++)
{
for (j = 0; j< 100; j++)
smallj] += a[i*100+j];
}
Assume pages are each 8K bytes. Also assume that the heap (where static data is
stored) is more than 8K bytes away from the stack.
Ignoring any memory used to hold the program instructions, what is the minimum
number of pages of physical memory this function will need to not swap pages to disk?
Briefly explain your answer (e.g., what is on each page).
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY