CPSC435 (W2008) Operating Systems Answer Key for Assignment 6 (problems) 1. Given the following information for a paging/segmentation system, determine (s,p,d) for the virtual address v = 97, where each page is 10 bytes. segment number s0 s1 s3 s4 se
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
ICS 143 Spring 2008 Programming Assignment (100 points) Electronic Copy Due: End of 10th week
* Start Early. * This homework can be done in groups of 2 or 3 * Every group will have to demo the project. The exact date and time will be announced later.
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
Homework 3B (30 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/tim
CPSC435 (W2008) Operating Systems Answer key for Assignment 1 1. Solve Problem 1 (p. 66) in the textbook.
S
S
p1
p1
p3 p5 p4 p2 p3
p4
p2 p5 p7 F FF
p6
2. Solve problem 2 (pp. 66-67) in the textbook. Note there are two parts in the problem. c
Homework 1B ICS143, 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.
Part B
Homework 1B ICS143, 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.
Part B
CPSC435 (W2008) Operating Systems Answer Key for Assignment 3
1. Given the following information: Job Number J1 J2 J3 J4 Arrival Time 0 1 2 3 CPU Time 10 2 3 1
Draw A Gantt Chart (i.e. timeline) for each of the following scheduling algorithms. a. F
CPSC435 (W2008) Operating Systems Answer Key for Assignment 4
1. Construct a request -allocation graph for a system containing the following information. (a) resource R1 has 2 units (b) resource R2 has 1 unit (c) resource R3 has 1 unit (d) resource
Name _
ID# _
Sample Final
1
Name _
ID# _
PART A
Mark the following (T-F) questions using T for true, and F for false. Write your answers in the table provided below (page 4).
1.
There are solutions to synchronization problems that can be imple
Name: _ Student ID: _
Sample Mid-Term
The exam consists of two main parts: 20 true/false questions worth 40 points. For each of these questions: - a correct answer will get you 2 points - an incorrect answer will get you 0.5 negative points - a que
CPSC435 (W2008) Operating Systems Answer Key for Assignment 2 (problems) 1. Solve Problem 8 (p. 67) in the textbook. (a) c1 = 1; regardless of the values of c2 and turn, p2 must wait. (b) c1 = 1, c2 = 1, and turn = 1 or 2; since turn can only have on