Computer Science 162 - Fall 1994 - Smith - Midterm 1

Computer Science 162 - Fall 1994 - Smith - Midterm 1 -...

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

View Full Document Right Arrow Icon

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

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

Unformatted text preview: <CS 162, MIDTERM 1, FALL 1994> CS 162 MIDTERM 1 FALL 1994 Prof. Alan Jay Smith You have until the end of class for this exam. The exam is closed book. 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. Please watch the front board for corrections and other informations. This exam has 6 questions on 7 pages and is in two parts. Problem #1 In a discrete event simulation (such as you did for assignment #1), explain how you compute (accurately) the mean number of customers in the system. Show a mathematical formula if that is necessary. (10) Problem #2 Define/explain the "exponential queue" scheduling algorithm. Explain the reasoning behind it - i.e. why should it work well? (12) Problem #3 Why is minimizing the variance of the flow time (var(f(i)) not the same as minimizing the variance of (f...
View Full Document

Page1 / 3

Computer Science 162 - Fall 1994 - Smith - Midterm 1 -...

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