# 2019期末考古試寫 ###### tags: `作業系統`, `109-2` :::success  頁面施工中  ::: :::warning  **此條目需要補充更多來源。** (2021年6月21日) 請協助補充多方面可靠來源以改善這篇條目,無法查證的內容可能會因為異議提出而移除。 ::: :::info <!--  -->  ((p)章節-投影片編號) ::: [TOC] ## Q1 Lock (Spinlock/ Mutex lock) - 依照情境選擇最好的 lock ## Q2 Deadlock - 給個系統問為甚麼不會有 deadlock ## Q3 Page - 給 Address Reference 跟 Page size 問 page number 跟 offset ## Q4 *同 2020 Q4* ## Q5 *同 2020 Q7*,只是多了要畫過程 ## Q6 *同 2020 Q3* ## Q7 Disk Blocks (inode) - given direct and indirect blocks ask max file size ## Q8 Benefit of Random access (to index file) ## Q9 RAID - Level 的差異 ## Q10 *同 2020 Q8*,但是演算法大雜燴 - FCFS - SSTF - SCAN - LOOK - C-SCAN - C-LOOK (BONUS)
×
Sign in
Email
Password
Forgot password
or
By clicking below, you agree to our
terms of service
.
Sign in via Facebook
Sign in via Twitter
Sign in via GitHub
Sign in via Dropbox
Sign in with Wallet
Wallet (
)
Connect another wallet
New to HackMD?
Sign up