2006年下半年软件设计师级答案

上午答案
(1) C (16) D (31) B (46) B (61) A
(2) A (17) B (32) D (47) C (62) A
(3) C (18) C (33) C (48) B (63) B
(4) B (19) D (34) D (49) D (64) A
(5) C (20) A (35) A (50) C (65) B
(6) B (21) B (36) B (51) B (66) C
(7) D (22) D (37) A (52) D (67) B
(8) A (23) A (38) C (53) A (68) C
(9) B (24) C (39) D (54) A (69) A
(10) C (25) D (40) B (55) B (70) C
(11) B (26) B (41) A (56) C (71) B
(12) C (27) D (42) A (57) B (72) C
(13) B (28) C (43) B (58) B (73) B
(14) A (29) C (44) C (59) D (74) D
(15) A (30) A (45) B (60) C (75) A

下午答案
试题一
[问题1] 初录数据、复录数据
[问题2] 0层图中,数据清除处理(加工6)没有输入数据流
[问题3] ①
[问题4] ①、②、④
[问题5] 手工分户帐=初录分户帐+复录分户帐

试题二
[问题1] (1)房间号,身份证号
[问题2]
  住宿主键:房间号,身份证号,入住日期
  住宿外键:房间号,身份证号,
[问题3] (2)住宿.身份证号  (3)HAVING (4)ORDER BY 2 DSC

[问题4]
  表:住宿    属性:入住日期    类型:聚簇索引
  原因:表中记录的物理顺序与索引项的顺序一致,根据索引访问数据时,一次读取操作可以获取多条记录数据,因而可减少查询时间。

试题三
[问题1](1)0..n  (2)1  (3)0..n  (4)1..n  (5)1 (6)0..n
[问题2]
 (1) getCategories
 (2) getCommodities
 (3) createPromotion
 (4) addCommodities
[问题3]
  关系:聚集(聚合)是关联的特例。不同点:聚集表示部分与整体关系的关联。

试题四
 
(1) f[0][0] = e[0] + a[0][0]
   f[1][0] = e[1] + a[1][0]
 (2) f[0][j-1]+a[0][j]
 (3) f[1][j-1]+a[1][j] < f[0][j-1]+t[0][j-1]+a[1][j]
 (4) fi = f[0][n-1]+x[0]
   li = 0
 (5) fi = f[1][n-1]+x[1]
   li = 1

试题五
 (1) EnQueue(&tempQ,root)
 (2) brotherptr = brotherptr -> nextbrother
 (3) !IsEmpty(tempQ)
 (4) DeQueue(&tempQ, &ptr)
 (5) !ptr->firstchild
 (6) EnQueue(&tempQ,ptr->firstchild)
 (7) brotherptr = brotherptr -> nextbrother

试题六
 (1) state == CLOSED || state == CLOSING
 (2) state == OPENING || state == STAYOPEN
 (3) state == OPEN
 (4) state ->click()
 (5) state ->timeout()
 (6) state ->complete()
 (7) door->setState(door->OPENING)

试题七
 
(1) state == CLOSED || state == CLOSING
 (2) state == OPENING || state == STAYOPEN
 (3) state == OPEN
 (4) state.click()
 (5) state.timeout()
 (6) state.complete()
 (7) door.setState(door.OPENING)

回目录 老顽童校对整理 2006年12月