Cs241fa09hw2-solutio - CS 241 Homework#2 Fall 2009 CS 241 Homework#2 Fall 2009 NetID ANSWER KEY 1 Two schemes are commonly used to manage free

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

View Full Document Right Arrow Icon
CS 241, Homework #2, Fall 2009 NetID: ______________________ CS 241, Homework #2, Fall 2009 ANSWER KEY 1. Two schemes are commonly used to manage free spaces for memory dynamic partitions: bit map and linked list. Which of the following is correct about these two schemes: A. In most cases, linked list is more space efficient B. In terms of processing time (updating the data structure due to allocation and deallocation), linked list is faster on average. C. On average, linked list is faster to find a free hole. D. A and B E. A and C (ANSWER) F. All of the above 2. Which one of the following best describes the Translation Lookaside Buffer? A. Is used to convert a physical address into a page offset. B. Is used to convert a virtual address into a page offset. C. Is used to cache the results of recent virtual page requests. (ANSWER) D. Is used for asynchronous virtual memory updates in concurrent systems. E. Is used to create process queues in a public virtual address space. 3. A server is 95% utilized. Assuming a single queue, Poisson arrivals, and exponentially distributed service times, if the average service rate is 10 requests/second, what is the average queuing time for an incoming request? A. 0.1 seconds B. 0.95 seconds C. 1.8 seconds D. 1.9 seconds (ANSWER) λ =9.5; ρ =10; W q = ρ /( μ - λ ) E. 2.0 seconds 4. If the incoming request rate on the above server dropped until its average utilization became 90%, what is the average number of requests in the entire system? A. 0.9 requests B. 8.1 requests
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 241, Homework #2, Fall 2009 NetID: ______________________ C. 9.0 requests (ANSWER): L = ρ /(1 - ρ ) = 9 D. 10.0 requests E. None of the above 5. Which of the following is the correct order of (a subset of) calls for a TCP client ? A. socket(); bind(); listen(); accept(); B. bind(); socket(); listen(); accept(); C. bind(); socket(); recvfrom(); D. socket(); bind(); recvfrom(); E. socket(); connect(); (ANSWER) 6. Which one of the following best describes disk I/O using polling? A. CPU time is required to continually check the status of I/O hardware and read/write bytes as needed (ANSWER) B. The CPU is interrupted when the I/O device is ready to transfer bytes C. The I/O device transfers bytes to main memory without CPU intervention. D. The I/O device uses a poll channel to halt the current CPU instruction. E.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/28/2011 for the course CS 241 taught by Professor Campbell during the Spring '08 term at University of Illinois, Urbana Champaign.

Page1 / 8

Cs241fa09hw2-solutio - CS 241 Homework#2 Fall 2009 CS 241 Homework#2 Fall 2009 NetID ANSWER KEY 1 Two schemes are commonly used to manage free

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

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