CSCI 237
Computer Organization
Home | Lectures | Labs | CS@Williams
Practice Problems
The table below lists practice problems from the book from Ch 4, 6, and 9. Some questions have answers in the textbook. These are useful for studying.
| Problem | Page # | Topics Covered (Notes) |
|---|---|---|
| 4.28 | 417 | Pipelining Tradeoffs |
| 4.29 | 418 | Pipelining Diminishing Returns |
| 6.2 | 592 | Hard disk parameters |
| 6.4 | 595 | Hard disk access patterns |
| 6.8 | 609 | C code and spatial locality |
| 6.9 | 616 | Cache parameters |
| 6.10 | 624 | Direct-mapped caches |
| 6.12-6.15 | 628 | Set-associative caches |
| 9.1 | 805 | Virtual Address Sizes |
| 9.2 | 807 | Page Table Entries |
| 9.3 | 816 | Address Translation |
| 9.4 | 824 | Address Translation with TLBs |
| 9.6 | 849 | Implicit free lists: Block size & header values |
| 9.7 | 852 | Minimum block sizes |
| 9.10 | 864 | Fragmentation and segregated lists |
| 9.15 | 879 | Block sizes and alignment with implicit free lists |
| 9.16 | 879 | Block sizes and alignment with explicit free lists |