Computer Science 162 - Fall 1991 - Smith - Midterm 1

Computer Science 162 - Fall 1991 - Smith - Midterm 1 - CS...

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

View Full Document Right Arrow Icon
CS 162, Midterm #1, Fall 1991 CS162, Fall 1991 Midterm #1 Professor Alan Smith Problem #1 When a compiler compiles a program and produces the corresponding object module(s), it also produces some information (in tables) to be used by the linker/loader. Please list and describe all such information, and explain why the linker/loader needs it. (15) Problem #2 What advantages (if any) are there in having different quantum sizes on different levels of a multilevel scheduling queueing algorithm. (10) Problem #3 What is the meaning of the term "busy waiting?" What other kinds of waiting are there? Can busy waiting be avoided altogether, assuming a machine with a "swap" instruction for synchronizaion. Explain. (12) Problem #4 Simulate the banker's algorithm to get a safe sequence for the following: There are 15 units currently free (available). (10) process already allocated total need A 100 250 B 40 180 C 20 30 D 110 140 file:///C|/Documents%20and%20Settings/Jason%20Raft. ..0-%20Fall%201991%20-%20Smith%20-%20Midterm%201.htm (1 of 2)1/27/2007 3:58:46 PM
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

Computer Science 162 - Fall 1991 - Smith - Midterm 1 - CS...

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

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