试题详情

试题内容

why have formal documents 
first, writing the decisions down is essential.Only when one writes do the gaps appear and the    (1)    protrude(突出).The act of writing turns out to require hundreds of mini-decisions.and it is the existence of these that distinguishes clear.exact policies from fuzzy ones.
Second.the documents will communicate the decisions to others. The manager will be continually amazed that poliaes he took for common knowledge are totally unknown by some member of his team . Since his fundamentaljob is to keep everybody going in the  (2)directon. his chief daily task will be communication, not decision-making,and his documents will immensely   (3)   this load.
Finally.a manager,s documents give him a data base and checklist. By reviewing them (4)he sees where he is. and he sees what changes of emphasis or shifts in direction are needed.
The task of the manager is to develop a plan and then to realize it. But only the written plan is precise and communicable. Such a plan consists of documents on what.when. how much.where.and who.This small set of critical documents  (5)  much of the manager.s   work.if their comprehensive and critical nature is recognized in the beginning. the manager can approach them as friendly tools rather than annoying busywork. He will set his direction much more crisply and quickly by doing so.
(1)A.inconsistencies
B.consistencies
C.steadiness
D.adaptability
(2)A.other
B.different
C.another
D.same
(3)A.extend
B.broaden
C.lighten
D.release
(4)A.periodically
B.occasionally
C.infrequently
D.rarely
(5)A.decides
B.encapsulates
C.realizes
D.recognizes

查看答案

软题库参考答案:A、D、C、A、B(仅供参考)

软题库解析:正在加载....

你可能感兴趣的试题

53题:设有关系模式R(A1,A2,A3,A4,A5,A6),函数依赖集F={A1→A3,A1 A2→A4,A5 A6→A1,A3 A5→A6,A2 A5→A6}。关系模式R的一个主键是( ), 从函数依赖集F可以推出关系模式R( )。
(1)A.A1A4
B.A2A5
C.A3A4
D.A4A5
(2)A.不存在传递依赖,故R为1NF
26题:极限编程(XP)的十二个最佳实践不包括()。
A.小的发布
B.结对编程
C.持续集成
D.精心设计
3题:

如果主存容量为16M字节,且按字节编址,表示该主存地址至少应需要( )位。
A、16
B、20
C、24
D、32

49题:现需要申请一些场地举办一批活动,每个活动有开始时间和结束时间。在同一个场地,如果一个活动结束之前,另一个活动开始,即两个活动冲突。若活动A从1时间开始,5时间结束,活动B从5时间开始,8时间结束,则活动A和B不冲突。现要计算n个活动需要的最少场地数。
求解该问题的基本思路如下(假设需要场地数为m,活动数为n,场地集合为P1,P2,…,Pm),初始条件Pi均无活动安排:
(1)采用快速排序算法对n个活动的开始时间从小到大排序,得到活动a1,a2,…,an。对每个活动ai,i从1到n,重复步骤(2)、(3)和(4);
(2)从p1开始,判断ai与P1的最后一个活动是否冲突,若冲突,考虑下一个场地P2,…;
(3)一旦发现ai与某个Pj的最后一个活动不冲突,则将a
28题:软件开发的目标是开发出高质量的软件系统,这里的高质量不包括()。
A.软件必须满足用户规定的需求
B.软件应道循规定标准所定义的一系列开发准则
C.软件开发应采用最新的开发技术
D.软件应满足某些隐含的需求,如可理解性、可维护性等
45题:

某公司数据库中的元件关系模式为P(元件号,元件名称,供应商,供应商所在地,库存量),函数依赖集F如下所示:
F={元件号→元件名称,(元件号,供应商)→库存量,供应商→供应商所在地}
元件关系的主键为(1),该关系存在冗余以及插入异常和删除异常等问题。为了解决这一问题需要将元件关系分解为(2 ),分解后的关系模式可以达到(3 )。
(1)A.元件号,元件名称
B.元件号,供应商
C.元件号,供应商所在地
D.供应商,供应商所在地
(2)A.元件1(元件号,元件名称,库存量)、元件2(供应商,供应商所在地)
B.元件1(元件号,元件名称)、元件2(供应商,供应商所在地,库存量)
C.元件1(元件号,元件名称)、元件2(元件号,供应商,库存量)、元件3(供应商,供应商所在地)
D.元件1(元件号,元件名称)、元件2(元件号,库存量)、元件3(供应商,供应商所在地)、元件4(供应商所在地,库存量)
(3)A.1NF
B.2NF
C.3NF
D.4