Computer Operating System
Computer Operating System
Study plan
D-4: 1/5 slide, 1H 30M
D-1:
- making cheat sheet, 10H
- Memorize codes 4H
D-0: Memorize code again, 1H
Professor
Songkuk Kim
Good
- Look over entire problems quickly and distribute time properly. The last problem was the hardest. But exhausted time to front part.
- FOCUS and solve as possible as quickly.
Last edited time
Dec 12, 2025 02:15 PM
Cheat sheet
Bad
- Memorize homework code and the entire process as well
Tendency
# Review
I finished the test just in time. It was not that hard. But I should have looked at the implementation process in my homework more closely."
# Problems
1. What is the condition of the deadlock? And how can you resolve deadlock?
2. 🤨 Make lock free linked list with CAS
3. Make unbounded buffer with semaphore
4. What is the advantage of file system which can use single 4KB block or eight 512byte blocks either? And how can you implement that file system?
5. 😅 What is the maximum file size when there are 8KB single block and inode file system which uses 12 direct blocks, single, double, and triple indirect blocks. The length of pointer which point to block is 4byte.
6. The FAT of all the files look like below. Explain each directories content. And draw the FAT.
music: 0, 3, 5
BestPart.mp3: 2, 1
Softly.mp3: 7, 6
7. What is the difference of
copy(/songs/a.mp3, /music/) and mov(/songs/a.mp3, /music/) ? Explain the entire processes in detail.
8. (Project 2-3) How can you make memory management on the xv6. Each process should have limits.
9. (Project 2-2) How can you make lottery scheduling on the xv6? Specify what you should modify and how you should modify.Term
2-1-Final
Exam note
Exam date
Dec 16, 2025 10:00