一起答
单选

设某磁带的有效磁带长为200m,记录的块系数为2,块间的间隔为10mm,记录长为100(byte),记录的密度为80(byte/mm)。将该磁带用于记录某种卡片(100byte),则磁带上能记录的卡片数可为(2)。

  • A.160
  • B.320
  • C.1.6万
  • D.3.2万
参考答案
查看试卷详情
相关试题
  1. (76)

    • A.dose to
    • B.during
    • C.within
    • D.beyond
  2. (74)

    • A.storage
    • B.data
    • C.range
    • D.link
  3. (73)

    • A.set
    • B.host
    • C.secondaries
    • D.record
  4. (75)

    • A.peripherals
    • B.database
    • C.the interface
    • D.clients
  5. (71)

    • A.DNA
    • B.SNA
    • C.the OSI
    • D.the ISO
  6. One of the functions of the(71)is to store the applications programs { or the various secondaries.  The(72)may have similar or dissimilar functions. The same control code received from two different, secondaries may warrant two different actions on the part of the host computer. If the system so requires, the host computer must also provide(73)for the centralized data and the software for database management. Data information is normally stored in auxiliary memories to which the computer has ready access. The(74)peripherals connected to the host computer allow for human entry and intervention. As needs change, application programs may require additions,  deletions, or changes. Data link problems also arise which are(75)the range of the computer's programmed capabilities. In such cases, human entry is required to make the necessary changes to resolve the existing problems.

    • A.peripherals
    • B.host computer
    • C.the interface
    • D.the client
  7. (70)

    • A.multi - user
    • B.client
    • C.server
    • D.full - user
  8. (68)

    • A.database
    • B.data representation
    • C.protocols
    • D.data communication
  9. (69)

    • A.same
    • B.similar
    • C.different
    • D.dependent
  10. (66)

    • A.求关键路径的方法
    • B.求最短路径的Dijkstra方法
    • C.深度优先遍历算法
    • D.广度优先遍历算法