 |
上午试题 /uploads/soft/1_080820095512.doc |
|
下午试题 /uploads/soft/1_080820095610.doc |
2002年度程序员级答案
上午答案
| (1)D | (2)A | (3)B | (4)B | (5)A |
| (6)B | (7)D | (8)D | (9)B | (10)B |
| (11)C | (12)C | (13)B | (14)C | (15)B |
| (16)B | (17)C | (18)D | (19)B | (20)C |
| (21)A | (22)D | (23)A | (24)D | (25)C |
| (26)B | (27)C | (28)C | (29)C | (30)A |
| (31)D | (32)D | (33)A | (34)B | (35)D |
| (36)B | (37)C | (38)C | (39)B | (40)C |
| (41)B | (42)A | (43)A | (44)B | (45)A |
| (46)B | (47)C | (48)C | (49)C | (50)D |
| (51)B | (52)C | (53)B | (54)B | (55)C |
| (56)D | (57)D | (58)C | (59)A | (60)C |
| (61)A | (62)B | (63)D | (64)C | (65)A |
| (66)A | (67)D | (68)C | (69)B | (70)D |
| (71)B | (72)A | (73)B | (74)C | (75)D |
下午答案
| 试题一 | 试题二 |
| (1) 3 | (1) s1++ |
| (2) 4 | (2) *s1= *s2 |
| (3) 1111 | (3) n<=0 ? ? n>=MAXLINE |
| (4) 或(加) | (4) a[i] > a[*index] |
| (5) 与(乘) | (5) a[*index] |
| 试题三 | 试题四 |
| (1) i-1 | (1) sieve[i] = 1 |
| (2) a[j+1] = a[j] | (2) sieve[factor] == 1 或 sieve[factor] > 0 或 sieve[factor] >= 0 或 sieve[factor] != -1 |
| (3) a[j+1] = t | (3) sieve[k] = -1 |
| (4) k > 1 | (4) k+factor |
| (5) a+1 , k-2 | (5) factor++ |
| 试题五 | |
| (1) &((*tree) -> left) | |
| (2) &((*tree) -> right) | (4)tag[top] == 1 或 tag[top] 或 tag[top] != 0 |
| (3) p = p -> left 或 p = stack[top] -> left | (5) p = stack[ top ] -> right |
