2008—2009学年第二学期期末考试A卷_8266_2079_20110531095340.doc

2008—2009学年第二学期期末考试A卷_8266_2079_20110531095340.doc

  1. 1、本文档共15页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
2008—2009学年第二学期期末考试A卷_8266_2079_20110531095340

北 京 交 通 大 学 2008―2009学年 第二学期期末考试 一. 选择填空题:请从给出的答案中选择正确的内容填入相应的空格。(每空1分,共20分) 1、’ task which belongs to the operating system. ①application; system; general; package. ②without applications and hardware; with hardware and without applications; without hardware and with applications; with hardware and applications. ③manage the bare computer; provide the system call; manage all the resources; compiling user’s program. 2、 waiting; new; terminated ⑦⑧⑨⑩: scheduler dispatch; I/O or event wait; interrupt;I/O or event completion. 3、’s algorithm is the way to ?( ) deadlock. The kill process method is a way to ? ( ) deadlock. ??ignore; detect; recovery; avoid; prevent; starvation; hold; request. 4、In paging storage management system, if the length of logical address is 24 bit, of which the length of page number is 14, the page size is ? ( ), and a program may contain ? ( ) pages at most. ??10;210 ; 214 ;14;24; 224 5、Disk Arm scheduling is to seek ?( ), Rotation scheduling is to seek sector.. ?sector; head; cylinder; disk; 6、、They are interrupt handlers, ?( ), ?( ) and user-space I/O software. ?? device driver; hard abstract layer; device-independent I/O software; buffering; DMA control; I/O boundary; programming I/O; channel mode. 8、semaphores ? debug; linking; compile; primitive; index; list. 二. 选择题:请从给出的答案中选择一个最正确的将其标号填入相应的括弧内。(每题1分,共20分) 1、A system is in a deadlock, if its resource allocation graphontains a cycle b) doesn’t contain a cycle c) contains a cycle and there is just one instance of every resource d) has at least one outgoing edge from any one of the process nodes 2、Two processes enter into critical zone by using semaphores mutex, at first mutex = 1, when mutex = 0 means A)none process enter the critical zone B)one process enter the critical zone C)two process enter the critical zone D)one process enter the critical zone, another one is waiting 3、global variables 4、here are 4 process

文档评论(0)

xcs88858 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

版权声明书
用户编号:8130065136000003

1亿VIP精品文档

相关文档