2009.9access试题及答案(国外英文资料).doc

2009.9access试题及答案 In September 2009, the national computer level examination paper was written on the second level 1, the choice (2 points, 70 points) (1) the following data structures are non-linear structures A) circular queue B) chain queue C) binary tree D) chain stack (2) in the following data, it is possible to access the data according to the principle of advanced postout A) circular queue B) stack C) the queue D) binary tree (3) for the loop queue, the following statement is correct A) the head of the team is fixed B) the head of the team must be greater than the tail pointer The head of the team must be smaller than the tail pointer D) the head of the team can be greater than the tail pointer, or the tail pointer (4) the spatial complexity of the algorithm means A) the computer storage space that the algorithm requires during execution B) the amount of data processed by the algorithm C) the number of statements or instructions in the algorithm program D) the number of temporary work units required during execution (5) a rule for partitioning modules in software design is A) low cohesion and low coupling B) high cohesion and low coupling C) low cohesion and high coupling D) high cohesion coupling (6) the following options do not belong to structured programming principles A) can be encapsulated D) top-down C) modularity D) step by step 7) the detailed design of the software is as follows: The picture is A) N - S figure B) PAD C) process flow chart D) E - R diagram (8) the database management system is A) part of the operating system B) system software supported by the operating system C) a compilation system D) an operating system (9) in the e-r graph, the graph used to represent the physical contact is A) elliptical graph B) rectangular C) the diamond D) triangle (10) there are three relationships R, S and T as follows: The relationship T is obtained by some operation by the relation R and S, which is the operation A) selection B) projection C) to pay D) an