Homework 5

INSTRUCTIONS

Out: Nov 2, 2005.
Due: At the start of lecture, November 14 (Monday), 2005. We will accept only solutions that are typed-up and printed out (figures and tables may be drawn by hand). No written solutions or online handins.
Resources you are allowed to use: Unless otherwise mentioned, the only resources you can use are the lectures slides, your notes, the Tanenbaum textbook, and any other textbook on OS's, architecture, data structures or previous CS material. You cannot refer to any online resources (unless otherwise mentioned). You cannot use ready-made solutions under any circumstances..
Relevant Lectures: 22-30.
Points: Unless otherwise mentioned, a problem is worth 5 points. The HW is worth a total of 30 points. If a question has multiple parts, the 5 points are split equally among the parts.
Warning: Homeworks are individual efforts. Although you are allowed to discuss HWs with your fellow students, you are expected to solve them yourself and type up the solution yourself. For detailed information on penalties, cheating and playing it safe, see this page.

UPDATES

11/11/05: Question 4 should be "answer 6.34."

PROBLEMS

1. Problem 6.13 from text.
2. Problem 6.22 from text.
3. Problem 6.37 from text.
4. Read about the MS-DOS FAT on page 403 and answer problem 6.34 from text.
5. A real-time system has to handle the following task set - each task is given by (period, worst-case-execution time) with the deadline=period: T1(10, 4); T2(20, 4); T3(5,1). If each task has one instance arrive at time t=0 and all tasks are NON-preemptible, draw a periodic schedule that admits all tasks. (Hint: if you draw a schedule that lasts a number of time units that is equal to the lowest common multiple of all task periods, that will suffice).
6. Problem 8.15 from text.

Updated: Nov 2, 2005. (c) Indranil Gupta.