



Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Main points of this exam paper are: Memory Reference, Main Memory, Regular Page, Page Table, Table Indicated, Main Memory, Regular Page, Tradeoffs, One Process, Scheduler
Typology: Exams
1 / 7
This page cannot be seen from the preview
Don't miss anything!




College of Engineering Department of Electrical Engineering and Computer Sciences Computer Science Division
CS 162, Fall, 2001 Prof. Alan Jay Smith Midterm 1, October 8, 2001 Part I
You have until the time announced for this exam. The exam is closed book and closed notes. All answers should be written on the exam paper. Anything that we can’t read or understand won’t get credit. Any question for which you give no answer at all will receive 25% partial credit. Please answer in standard English; illiterate or illegible answers to essay questions will lose credit. If we can’t understand your answer, it is wrong. Partial credit will be given for “compu- tation-type” problems only if your errors are obvious to the grader; we are not going to spend significant time debugging your solution. If necessary, you may continue on the back of a page. Please watch the front board for corrections and other information. This exam has 7 questions on 7 pages and is in two parts. Answers may be continued on the back of a page.
Name ( last , first, middle):______________________________________
Student ID #_________________________ Code #_____________________
Class Account:____________________________________
Name (last, first, middle):______________________________________
Name (last, first, middle):______________________________________
Process Arrives CPU time 1 0 3 2 2.1 1 3 3.2 5 4 4.3 2
a) RR (quantum = 0.5) b) SRPT c) SJF d) SET (quantum = 0.5)
Name (last, first, middle):______________________________________
Process has-X has-Y max-needs-X max-needs-Y A 10 20 75 50 B 0 70 50 90 C 30 10 60 40 D 50 80 100 220
(a) available: X: 40 Y: 40 (b) available: X: 40 Y: 35
Name (last, first, middle):______________________________________