FinalExamSp11-Solutions

# FinalExamSp11-Solutions - Student Name SID University of...

This preview shows pages 1–3. Sign up to view the full content.

CS 162 Final Page 1 May 13, 2011; 8:00-11:00 PM University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Science CS 162 I. Stoica Spring 2011 FINAL EXAM Friday, May 13, 2011 INSTRUCTIONS—READ THEM NOW! This examination is CLOSED BOOK/CLOSED NOTES. There is no need for calculations, and so you will not require a calculator, Palm Pilot, laptop computer, or other calculation aid. Please put them away. You MAY use one 8.5” by 11” double-sided crib sheet, as densely packed with notes, formulas, and diagrams as you wish. The examination has been designed for 80 minutes/80 points (1 point = 1 minute, so pace yourself accordingly). All work should be done on the attached pages. In general, if something is unclear, write down your assumptions as part of your answer . If your assumptions are reasonable, we will endeavor to grade the question based on them. If necessary, of course, you may raise your hand, and a TA or the instructor will come to you. Please try not to disturb the students taking the examination around you. __________________________________________ SID: _______________________________ (Signature) __________________________________________ Discussion Section (Day/Time): ________ (Name—Please Print!) QUESTION POINTS ASSIGNED POINTS OBTAINED 1 20 2 15 3 10 4 20 5 10 6 10 7

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

View Full Document
Student Name: _____________________________________ SID: _____________________ CS 162 Final Page 2 May 13, 2011; 8:00-11:00 PM Question 1. Miscellaneous (20 points) For each of the following statements, indicate whether the statement is True or False, and provide a very short explanation of your selection (2 points each). a. Starvation implies deadlock. T F Rationale: With starvation at least one job makes progress. In case of deadlock, no job makes progress. b. A two-way set associative cache has a higher hit rate than a direct cache of same size. T F Rationale: Any access pattern that fits in a direct cache also fits in a two-way set associative cache of the same size. We also considered F as there are access patterns for which both the two-way associative cache and a direct cache have the same hit rate. c. With datagram packet switching each packet is individually routed. T F Rationale: Each router independently forwards each packet based on its destination address. If the conditions in the network change (i.e., failures, congestions), a router can forward packets for the same destination along different paths. d. A store-and-forward router starts forwarding the packet as soon as it gets packet’s header. T F Rationale: No. The router waits to receive the entire packet before forwarding it, hence the store-and-forward name. This allows a router to enque packets if the output link is congested, and drop a packet if it has been
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 14

FinalExamSp11-Solutions - Student Name SID University of...

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

View Full Document
Ask a homework question - tutors are online