spring08_homework3A

spring08_homework3A - Homework 3(72 Points CS 143A Spring...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Homework 3 (72 Points) CS 143A, Spring 2008 Start Early. Do not hesitate to ask questions. If you make any assumptions, state them and be brief in your answers. Hand in your homework to the distribution center before the following due  date/time. Due Date: 5/28/08 2pm Wednesday Question 1 (20 points):  Consider the following snapshot of a system: Process Allocation Max Available A B C D A B C D A B C D P0 1 1 1 4 1 7 5 6 2 3 1 1 P1 0 4 3 2 0 5 6 2 P2 0 0 1 2 0 0 1 2 P3 1 4 2 0 1 7 5 0 P4 1 3 5 4 2 3 5 6 What is the contents of the matrix Need?  (10 points) Process Need A B C D P0 P1 P2 P3 P4
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Is the system in a safe state? If yes, give a safe sequence of processes. If your answer is  no, explain why.  (10 points) Question 2 (6 Points): Consider a logical address space of 256 pages of 512 words each, mapped onto a physical memory of  64 frames.  Assume the architecture is word-addressed (i.e., each address in the memory addresses a 
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 06/18/2009 for the course CSE 104 taught by Professor Franklin,s during the Spring '08 term at UC Irvine.

Page1 / 4

spring08_homework3A - Homework 3(72 Points CS 143A Spring...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online