Today we will review the course by examining an old final exam. Old final exam.
Of course, your final exam will be a bit different from this, but this will give you an idea of the sort of things I’m likely to ask.
Today we’ll talk about I/O devices and how the computer manages them. Lecture 23 slides.
Today we’ll look at how the operating system uses the virtual memory system to run programs. Lecture 22 slides.
We’ve seen how to make memory look fast using cache, now we’ll look at how to make memory look bigger. Lecture 21 slides.
Problems 7.2-7.5, 7.9, 7.10, 7.16
Due: 24 April.
Today we’ll look at more details of the cache. Lecture 20 slides.
Today we’ll begin to talk about using the memory hierarchy to create the illusion of a large-fast-cheap memory. Lecture 19 slides.
Study in Chapter 7, sections 7.1-7.5.
Today we’ll look at the difficulties that arise from trying to do more than one thing at a time. Lecture 18 slides.
Today we’ll see how we can speed up our computer using pipelining. Lecture 17 slides.