A machine has a 32-bit address space and an 4-kb page

Assignment Help Operating System

Reference no: EM13165816

A machine has a 32-bit address space and an 4-KB page. Suppose a simple OS just boot up on the machine, running a single process. The process uses 2 memory pages for the text and data memory (combined) near the lowest virtual address, and 1 memory page for the stack memory near the highest virtual address.

Suppose each page table or page directory entry is 8 bytes. A single-level page table would require KB of memory; a 2-level page table, with address bits for the virtual page number equally divided by the two levels, would require at least KB of memory and at most KB of memory.

(Note: 1KB = 1024 bytes)

Reference no: EM13165816

Questions Cloud

A file system stores every file under a i-node : suppose a file system stores every file under a i-node similar to (but may not be the same as) the Unix V7 File System. The i-node contains 15 addresses, each address has 32 bits (4 bytes).

Value referenced by the pointer. : Add 10 to the value referenced by pointer switch.Add 4 to the address stored in pointer switch.Subtract 5 from the value referenced by the pointer.

Create an application for disney''s cottages : Create an application for Disney's Cottages, a weekend getaway resort that rents cottages and boats to use on the local lake

You assign each int with a particular id : You assign each int with a particular ID.Array (4, 5, 6, 5, 4, 6) ID (1, 2, 3, 4, 5, 6)

A machine has a 32-bit address space and an 4-kb page : A machine has a 32-bit address space and an 4-KB page. Suppose a simple OS just boot up on the machine, running a single process. The process uses 2 memory pages for the text and data memory (combined) near the lowest virtual address, and 1 memory pa..

If ptr is a pointer to a character : If ptr is a pointer to a character and has been initialized to point to the first element of arr, write a statement using ptr that is equivalent to the statement array[4] = 12.

Various search trees and numerous sorting techniques : This week we were introduced to various search trees and numerous sorting techniques. Taking into consideration what you have learned this week, discuss how you can help Bob with his problem.

Test a program that prompts for the user : Write and test a program that prompts for the user to input a file name and uses two functions head() and tail() - head() displays the first 10 lines of a file

Program to input the length of the side from the keyboard : write a program to input the length of the side from the keyboard ,use the class to obtain the areas of all shapes and display the results on the screen

User Account

All Pages