Sp06 midterm 1

Sp06 midterm 1 - University of California, Berkeley College...

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

View Full Document Right Arrow Icon
Page 1/10 University of California, Berkeley College of Engineering Computer Science Division – EECS Spring 2006 Anthony D. Joseph Midterm Exam March 8, 2006 CS162 Operating Systems Your Name: SID AND 162 Login: TA Name: Discussion Section Time: General Information: This is a closed book and notes examination. You have 90 minutes to answer as many questions as possible. The number in parentheses at the beginning of each question indicates the number of points given to the question; there are 100 points in all. You should read all of the questions before starting the exam, as some of the questions are substantially more time consuming. Write all of your answers directly on this paper. Make your answers as concise as possible. If there is something in a question that you believe is open to interpretation, then please ask us about it! Good Luck!! Problem Possible Score 1 21 2 54 3 12 4 13 Total 100
Background image of page 1

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

View Full DocumentRight Arrow Icon
CS 162 Spring 2006 Midterm Exam March 8, 2006 Page 2/10 1. (21 points total) Short answer questions: a. (4 points) True/False and Why? Lottery scheduling can be used to implement any other scheduling algorithm. TRUE FALSE Why? b. (5 points) Inverted Page Tables: i) (3 points) Give a two to three sentence description of an inverted page table. ii) (2 points) Briefly (2-3 sentences) state the problem it is intended to solve. c. (4 points) Why would two processes want to use shared memory for communication instead of using message passing? Your answer should be brief (no more than 5 sentences).
Background image of page 2
CS 162 Spring 2006 Midterm Exam March 8, 2006 Page 3/10 d. (4 points) We say that the operating system is an “illusionist”. Name two illusions that it provides: i) (2 points) Illusion #1: ii) (2 points) Illusion #2: e. (4 points) For system calls, we explained that arguments are sanity checked twice. i) (2 points) When is each check performed? ii) (2 points) Why is this redundancy important?
Background image of page 3

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

View Full DocumentRight Arrow Icon
March 8, 2006 Page 4/10 2. (54 points total) CPU Scheduling. Here is a table of processes and their associated arrival and running times. Process ID Arrival Time Expected CPU Running Time Process 1 0 5 Process 2 3 5 Process 3 5 3 Process 4 7 2 a. (15 points) Show the scheduling order for these processes under First-In-First-Out (FIFO), Shortest-Job First (SJF), and Round-Robin (RR) with a quantum = 1 time unit. Assume that the context switch overhead is 0 and new processes are added to the head of the queue except for FIFO. Time
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This homework help was uploaded on 01/30/2008 for the course CS 162 taught by Professor Kubiatowicz during the Spring '02 term at Berkeley.

Page1 / 10

Sp06 midterm 1 - University of California, Berkeley College...

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

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