For each lecture, we'll post slides, an outline of the content, a recording, and supplemental reading. Slides will be up before lecture (but not necessarily at 9:00am); we post slides with all animations (good for following along exactly) and with limited animations (good for studying/taking notes on). The outline and recording will be posted after lecture (but not necessarily at 3:00pm; likely the next day or so). You can do the supplemental reading before or after lecture; whatever works best for you.

• Slides: all animations, limited animations
• Outline
• Recording
• Supplemental Reading: Textbook §8.1, §8.2, §8.3

After this lecture, at a minimum, you should be able to do the following:

• Given two bitstrings A and B, compute A XOR B. Given A XOR B and B, compute A.
• Given a RAID system with a failed disk, explain how to recover the failed disk
• Describe how reads and writes work in RAID 1, RAID 4, and RAID 5
• Describe the performance trade-offs among the levels of RAID
• Given a sequence of disk failures over time, explain whether RAID can recover the system (e.g., can RAID 5 recover if two of its disks fail at the exact same moment)

Practice problems

Some of these problems also include concepts from future lectures and recitations, such as 2PL and FORCE and STEAL policies.

• 2018, Problem 1 (Solutions)
• 2017, Problem 1 (Solutions)
• 2016, Problem 1 (Solutions)
• 2015, Problem 1 (Solutions)