一起答
单选

在实现文件系统时,为加快文件目录的检索速度,可利用“文件控制块分解法”。假设目录文件存放在磁盘上,每个盘块512字节。文件控制块占64字节,其中文件名占8字节,文件内部号和文件其他描述信息占56字节。设某一目录文件共有254个文件控制块,采用分解法前查找该目录文件的某一个文件控制块的平均访门磁盘次数为(64)。若目录文件分解前占用n个盘块,则分解后改用m个盘块存放文件名和文件内部号部分,那么访问磁盘次数减少的条件是(65)。

  • A.2
  • B.4
  • C.8
  • D.16
参考答案
查看试卷详情
相关试题
  1. (74)

    • A.inconsistent
    • B.independent
    • C.interface
    • D.incompatible
  2. (75)

    • A.application software
    • B.eye-tracking device
    • C.application programs
    • D.vitual reality
  3. (73)

    • A.explicit
    • B.voice
    • C.implicit
    • D.special
  4. (72)

    • A.DBMS
    • B.application software
    • C.operating systems
    • D.GUI
  5. (70)

    • A.messages
    • B.packets
    • C.information
    • D.reengineering
  6. Although the bulk of industry resources and energies have focused on developing the fastest(71)or slickest(72), more and more mindshare is turning to the evolution of the computer interface. Advancements in the areas of input devices,(73)processing and vitual reality could lead to fundamental changes in the way human and computer interact. The technological battlefield of the future will be adding layers between the user and the raw machine to make the(74)as invisible as possible.(75)crepresents the next evolutionary step for the interface.

    • A.microprocessor
    • B.format
    • C.structure
    • D.procedure
  7. (69)

    • A.retrieval
    • B.route
    • C.path
    • D.save
  8. (67)

    • A.format
    • B.documents
    • C.text
    • D.network
  9. (68)

    • A.database
    • B.controller
    • C.lifecycle
    • D.center
  10. (65)

    • A.m<n-1
    • B.m<n-2
    • C.m>n-1
    • D.m>n-2