print · source · login   

Schedule

Note: The US version of the book has different chapter and exercise numbers!

Note: All questions require an explanation, even if this is not explicitly stated in the question!

DateTopicReadWeekly exercises
September 4Intro and processesChapter 1 - 1.9
Chapter 2 - 2.5 + 2.10
Chapter 3 - 3.4 + 3.6.3
1.8: " What is the purpose of interrupts? How does an interrupt ... "
1.10: " Some computer systems do not provide a privileged mode ... "
2.2: " Describe three general methods for passing parameters ... "
2.7: " What are the two models of interprocess communication ... "
3.2: " Describe the actions taken by a kernel to context-switch ... "
3.5: " Including the initial parent process, how many processes ... "
September 11Multithreaded ProgrammingChapters 4.1-4.3, 4.5, 4.6, 4.84.1: "Provide two programming examples in which multithreading..."
4.3: "Which of the following components of program state..."
4.4: "Can a multithreaded solution using..."
4.6: "Is it possible to have concurrency..."
4.8: "Determine if the following problems exhibit..."
4.10: "Consider the following code segment...Careful: Use the fork() version that terminates all other threads in the children."
September 18Scheduling and Synchronization (part 1)Chapters 5.1-5.4, 5.8
Chapters 6.1-6.3
5.1: "Why is it important..."
5.2: "Discuss how the following..."
5.5: "Consider the exponential average..."
5.7: "Consider the following set of processes..."
5.10: "Which of the following is used..."
5.12: "Consider a system running ten..."
6.2: "The first known correct software..." Remark: A concise explanation suffices as proof.
September 25Synchronization (part 2) and deadlocksChapters 6.4-6.7
Chapters 7 (all)
6.14 Consider the code example...
6.17 Show how to implement the wait()...
6.22 Discuss the tradeoff between fairness...
7.9 Consider the version of the dining-...
7.10 Consider again the setting in the preceding question...
October 2Memory-management strategiesChapters 8-8.58.1 Explain the difference between...
8.5 Compare the memory organization...
8.7 Explain why mobile operating systems such as iOS and Android...
8.13 The BTV Operating system has 21-bit virtual address, ....
October 9Virtual-memory managementChapters 8.6 & 9-9.3 & 9.6-9.98.17 "Consider a paging system with ... stored in memory"
8.21 "What is the purpose of paging the page tables?"
9.1 "Assume that a ... following can occur."
9.7 "When a page fault ... brought into memory? Explain."
9.18 "Consider a demand-paging ... memory acces time?"
9.25 "Consider a system that ... provide this functionality?"
October 16File systemsChapters 10-10.4, 11-11.5A Uppaal model for Hyman's algorithm
10.1 Consider a file system in which a file can be deleted and ...
10.2 The -open-file table is sued to maintain information about ...
10.6 If the operating system knew that a certain application was ...
11.8 Consider a file system that uses inodes to represent files ...
11.9 Fragmentation on a storage device can be eliminated by ...
October 23I/O SystemsChapters 13.1-13.5,13.713.1 When multiple interrupts from different devices appear ...
13.2 What are the advantages and disadvantages ...
13.3 Consider the following I/O scenarios ...
13.5 What are the various kinds of performance overhead ...
13.6 Describe three circumstances under which blocking ...
13.8 Some DMA controllers support direct virtual memory access ...

Mapping of exercises from the international student editon to the American 9th edition of the book (done by students)

8.17 -> 8.25
8.21 -> 8.29
9.1 -> 9.14
9.7 -> 9.20
9.18 -> 9.31
9.25 -> 9.38

Mapping of exercises from the international student editon to the American 9th edition of the book (done by students)

10.1 -> 11.9
10.2 -> 11.10
10.6 -> 11.14
11.8 -> 12.16
11.9 -> 12.17

Mapping of exercises from the international student editon to the American 9th edition of the book (done by students)

13.1 -> 13.8
13.2 -> 13.9
13.3 -> 13.10
13.5 -> 13.12
13.6 -> 13.13
13.8 -> 13.15