试题详情

试题内容

Observe that for the programmer, as for the chef, the urgency of the patron(顾客)
may govern the scheduled completion of the task, but it cannot govern the actual completion.
An omelette(煎鸡蛋), promised in two minutes, may appear to be progressing nicely. But
when  it  has  not  set  in  two  minutes,  the  customer  has  two  choices—waits  or  eats  it  raw. Software customers have had  (1)  choices.Now I do not think software  (2)  have less inherent courage and firmness than chefs, nor than other engineering managers. But false  (3)  to match the patron's desired date is much more common in our discipline than elsewhere in engineering. It is very  (4)to make a vigorous, plausible, and job risking defense of an estimate that is derived by no quantitative method, supported by little data, and certified chiefly by the hunches of the managers.Clearly two solutions are needed. We need to develop and publicize productivity figures, bug-incidence figures, estimating rules, and so on. The whole profession can only profit from  (5)  such data. Until estimating is on a sounder basis, individual managers will need to stiffen their backbones and defend their estimates with the assurance that their poor hunches are better than wish derived estimates.
(1)A、no
B、the same
C、other
D、lots of
(2)A、testers
B、constructors
C、managers
D、architects
(3)A、tasks
B、jobs
C、works
D、scheduling
(4)A、easy
B、difficult
C、simple
D、painless
(5)A、sharing
B、excluding
C、omitting
D、ignoring

查看答案

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

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

你可能感兴趣的试题

44题:

在11个元素的有序表A[1..11] 中进行折半查找( L(low+high)/2」 )查找元素A[11]时,被比较的元素的下标依次是( )。
A、6,8,10,11
B、6,9,10,11
C、6,7,9,11
D、6,8,9,11

52题:折半查找在有序数组A中查找特定的记录K:通过比较K和数组中的中间元素A[mid]进行,如果相等,则算法结束∶如果K小于[Amid],则对数组的前半部分进行折半查找∶否则对数组的后半部分进行折半查找。根据上述描述,折半查找算法采用了(62)算法设计筑略。对有序数组(3,14,27,39,42,55,70,85,93,98),成功查找和失败查找所需要的平均比较次数分别是(63)(假设查找每个元素的概率是相同的)
A.分治
B.动态规划
C.贪心
D.回溯
A.29/10和29/11
B.30/10和30/11
C.29/10和39/11
D.30/10和40/11
39题:

对高级语言源程序进行编译的过程可以分为多个阶段,分配寄存器的工作在()阶段进行。
A.词法分析
B.语法分析
C.语义分析
D.目标代码生成

53题:

设求解某问题的递归算法如下:
F(int n){
if n==1 {
Move(1)
}else{
F(n-1);
Move(n);
F(n-1);
}
}
求解该算法的计算时间时,仅考虑算法Move所做的计算为主要计算,且Move 为常数级算法。则算法F的计算时间T(n)的递推关系式为(1) ;设算法Move的计算时间为k,当n=4 时,算法F的计算时间为(2) 。
(1)A、T(n)=T(n-1)+1
B、T(n)=2T(n-1)
C、T(n)=2T(n-1)+1
D、T(n)=2T(n+1)+1
(2)A、14k
B、15k
C、16k
D、17k

51题:

采用二维表格结构表达实体类型及实体间联系的数据模型是 ( ) 。
A、层次模型
B、网状模型
C、关系模型
D、面向对象模型

9题:

王某是某公司的软件设计师,每当软件开发完成后均按公司规定编写软件文档,并提交公司存档。那么该软件文档的著作权(  )享有。
A. 应由公司
B. 应由公司和王某共有
C. 应由王某
D. 除署名权外,著作权的其它权利由王某