User Account

All Pages

How many bits are required for each virtual address

Assignment Help Operating System
Reference no: EM13944664

A system implements a paged virtual address space for each process using a one-level page table. The maximum size of virtual address space is 16MB. The page table for the running process includes the following valid entries (the --> notation indicates that a virtual page maps to the given page frame, that is, it is located in that frame):

Virtual page 2 --> Page frame 4

Virtual page 4 --> Page frame 9

Virtual page 1 --> Page frame 2

Virtual page 3 --> Page frame 16

Virtual page 0 --> Page frame 1

The page size is 1024 bytes and the maximum physical memory size of the machine is 2MB.

a.How many bits are required for each virtual address? (decimal)

b.How many bits are required for each physical address? (decimal)

c.What is the maximum number of entries in a page table? (decimal)

d.To which physical address will the virtual address (1524)base10 translate? (decimal)

e.Which virtual address will translate to physical address (1024)base10? (decimal)

Reference no: EM13944664

Questions Cloud

What is the average number of machine cycles per instruction : What is the average number of machine cycles per instruction for this microprocessor, including its memory fetch instructions?
Business overview of the organisation : Provide a business overview of the organisation on which you will be basing your assignment. Include the name of the organisation, the number of staff - including fulltime, part time and casual, diversity mix of current staff, the location of the ..
What is the dream argument : What are the three skeptical arguments that Descartes discusses in Meditation 1? And which of these arguments does Descartes think gives reasons to doubt not only our perceptual beliefs but even our simple mathematical beliefs?
Appropriate quantile-critical bound : You are running a one-sided test of H0: μ = μ0, where q is the appropriate quantile/critical bound. (Note: q may be positive or negative, depending on the test.) Do you reject H0 if H1: μ > μ0 and t > q?
How many bits are required for each virtual address : A system implements a paged virtual address space for each process using a one-level page table
Access to scholarly information services : This position contributes to supporting user access to scholarly information services within a secure environment by coordinating the Library's high demand resources in a variety of formats. The position is also required to liaise with staff acros..
Any potential negative aspects of the technology : "An emerging technology not in use at the company such as a wireless network or PDAs."
Prepare a classified balance sheet for simon company : From the following data, prepare a classified balance sheet for Simon Company at December 31, 2006
What extent will porter five competitive forces : To what extent will Porter's five competitive forces help or hurt Azul Linhas Aereas Brasileiras's growth strategy? Discuss.

Reviews

Write a Review

Operating System Questions & Answers

  Implementation of algorithms for process management

The Shortest Job Next (SJN) algorithm queues processes in a way that the ones that use the shortest CPU cycle will be selected for running rst.

  Develop a user mode command interpreter

Develop a user mode command interpreter which support list-short.

  Memory allocation in operating system

Analysis and implementation of algorithms for memory allocation in operating system, Explain First- t and best- t methods are used in memory allocation in operating systems.

  Stand alone child process

Forking the child process

  Write a multi-threaded program

Write a multi-threaded program to solve producer and consumer problem

  Marginal and average cost curves

n a competitive market place (pure competition) is it possible to continually sell your product at a price above the average cost of production.

  Simulating operating systems scheduling

Simulate the long-term scheduler, the short-term scheduler and the I/O scheduler of the computer using the First-Come-First-Serve algorithm.

  Issues with trusted platform module

Research paper discussing the issues with Trusted Platform Module (TPM)

  Threads

Explain a complication that concurrent processing adds to an operating system.

  Design and programming

Use the semaphore methods to control the concurrency of the solution

  Virtual machines

Virtual machines supported by a host operating system

  Discuss an application that benefits barrier synchronization

Discuss an application that would benefit from the use of barrier synchronization

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

Submit Assignment

Academics

Major Subjects

Majors

Get In Touch

whatsapp: +1-415-670-9521

Phone: +1-415-670-9521

Email: [email protected]

TERMS & POLICIES

HELP & SUPPORT

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd