2001年度高级程序员级答案
上午答案
(1)D | (2)A | (3)B | (4)A | (5)B |
(6)D | (7)A | (8)C | (9)B | (10)C |
(ll)B | (12)B | (13)D | (14)A | (15)A |
(16)A | (17)B | (18)B | (19)D | (20)C |
(21)C | (22)A | (23)D | (24)C | (25)B |
(26)B | (27)A | (28)B | (29)B | (30)C |
(31)C | (32)C | (33)A | (34)B | (35)B |
(36)D | (37)C | (38)A | (39)B | (40)D |
(41)A | (42)B | (43)B | (44)C | (45)D |
(46)A | (47)D | (48)D | (49)A | (50)D |
(51)D | (52)D | (53)B | (54)C | (55)A |
(56)C | (57)A | (58)C | (59)B | (60)A |
(61)A | (62)D | (63)B | (64)C | (65)B |
(66)D | (67)A | (68)B | (69)A | (70)B |
(71)B | (72)A | (73)D | (74)C | (75)D |
下午答案
试题一
[问题1)
处理l和处理4:发货单和受款单中的非法销售代号、商品代号;
数量和金额非正整;单位I*数量,i金额;输入中的非法字符;
处理7:重复付款和找不到与收款单位相对应发货单;
[问题2]
因文件分类,处理时要增加访问外存的时间或需大量内存,从而降低了处理速度
[问题3]
删除收款文件中的所有记录
试题二
[问题1]成绩文件可删
试题二
试题三
(1) LD GR0,0GR1
(2) JZE GOON
(3) EOR GR3,V1
(4) OR GR0,V0, GR3
(5) JNZ LOOP
试题四
(1) (NODE*) malloc (sizeof (NODE))
(2) makeTree ( )
(3) *str == ','
(4) putchar (t->val)
(5) walkTree (t->subTree[i])
试题五
(1) color[*ip]
(2) adj[i][j] != 0 && color[j] == c
(3) i,k,adj,color
(4) select (i,c+l,adj,color)
(5) color[i]=c