[理工] [OS] 99中山資工&97台大軟體設計

看板Grad-ProbAsk作者boy5548 (小YO)時間15年前 (2011/01/30 22:10)推噓3(3推 0噓 11→)

留言14則, 7人參與討論串1/1

Consider a file system on a disk that has both logical and physical block sizes of 512 bytes.Assume that the information about each file is already in memory. For each of the three allocation strategies(Contiguous,linked,indexed),answer the questions: (a)How is the logical-to-physical address mapping accomplished in this system? (For the indexed allcation,assume that a file is always less than 512 blocks long.) 這題該怎麼答..? (b)If we are currently at logical block 10(the last block accessed was block 10) and want to access logical boldk4,how many physycal blocks must be read from the disk? 這題想問的是index allcation，解答給的答案是2，為什麼不是1呢? 謝謝!! -- 另外是台大資工97年的軟體設計題目在此 http://www.lib.ntu.edu.tw/exam/graduate/97/97420.pdf 想問一下第7題，題目簡單來講，就是問Longest common substring problem 可以在O(nlgn)下解決嗎? 正常應該是O(mn)吧 (m,n為字串A,B之長度) -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 114.39.2.216 ※ 編輯: boy5548 來自: 114.39.2.216 (01/30 22:19)

→

skyevolution

01/30 22:15, , 1^F

01/30 22:15, 1^F

→

boy5548

01/30 22:25, , 2^F

01/30 22:25, 2^F

→

boy5548

01/30 22:25, , 3^F

01/30 22:25, 3^F