[理工] [OS]-幾題問題

看板Grad-ProbAsk作者 (梨子)時間16年前 (2010/02/19 14:54), 編輯推噓5(5推 0噓 13→)
留言18則, 5人參與, 最新討論串1/2 (看更多)
請問下列幾題怎麼選 1.What is the most required hardware support for a memory mangement system using demand-paging? (A)data cache (B)instruction cache (C)translation look-ahead buffers (D)Harvard architecture 2.The FAT file system format (A)uses a kind of linked allocation techniques (B)uses a kind of indexed allocation techniques (C)is a kind of log-structured file systems (D)is efficient for sequential access (E)is efficient for direct random access 3.True or False The buddy memory allocation technique is a memory allocation technique that aims to solve the external fragmentation problem -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 140.116.243.66
→
02/19 15:04, , 1F
3 false
02/19 15:04, 1F
推
02/19 15:09, , 2F
3.不是true?
02/19 15:09, 2F
→
02/19 15:10, , 3F
2.AE
02/19 15:10, 3F
→
02/19 15:13, , 4F
我覺得 1C 2 A
02/19 15:13, 4F
→
02/19 15:14, , 5F
Buddy最大的缺點就是內外碎裂都有
02/19 15:14, 5F
→
02/19 15:18, , 6F
02/19 15:18, 6F
推
02/19 15:18, , 7F
問一下為啥2E不行 direct時先在FAT上跑不是也頗有效率?
02/19 15:18, 7F
推
02/19 15:31, , 8F
印象中FAT通常會抓到memory中 所以先在memory中跑 再去
02/19 15:31, 8F
→
02/19 15:32, , 9F
disk中抓要的檔案 會比單純linked快得多 有錯請指正= =a
02/19 15:32, 9F
→
02/19 15:38, , 10F
FAT是在DISK裡面吧@@ FAT會有較多的disk head move
02/19 15:38, 10F
→
02/19 15:39, , 11F
但是可以最佳化direct random access，不知道要不要選
02/19 15:39, 11F
→
02/19 15:39, , 12F
另外，2.C 沒有嗎?
02/19 15:39, 12F
推
02/19 15:47, , 13F
log-structured file system 是像I-node 那種吧
02/19 15:47, 13F
→
02/19 15:57, , 14F
恩...只有一層的direct data access?
02/19 15:57, 14F
→
02/19 17:48, , 15F
抱歉3應該是true，剛才去查了一下資料
02/19 17:48, 15F
→
02/19 17:49, , 16F
FAT是link base的方法，支援連續讀取，隨機比較困難
02/19 17:49, 16F
→
02/19 18:31, , 17F
THX!
02/19 18:31, 17F
推
02/19 18:48, , 18F
1.C 2.A
02/19 18:48, 18F
‣ 更多 crazyjoe 的文章
文章代碼(AID): #1BVZMuC1 (Grad-ProbAsk)
‣ 更多 crazyjoe 的文章
文章代碼(AID): #1BVZMuC1 (Grad-ProbAsk)