计算机二级C语言考试笔试考点（国外英文资料）.doc

计算机二级C语言考试笔试考点（国外英文资料） The author of the secondary public basic examination of the computer rank test. Learning to be quiet has been Shared 32 times (0) to copy links The following are divided into four parts. The three asterisks are listed in this paper, which is very important. It is also important to note two asterisks or an asterisk, which is easy to get. The content of the parenthesis, which is said to be accurate. Five pages in the entire document, the advice should be carefully remembered before the test. The first part of the algorithm is the data structure (41%) 1, the algorithm The correct and complete description of the problem processing solution is called an algorithm. The aim of the algorithm analysis is to improve the efficiency of analytical algorithm. The basic characteristics of the algorithm are [feasibility], [certainty], [being poor] and having enough information. The poor sex of the algorithm means that the running time of the algorithm is limited. The complexity of the algorithm is a measure of how good the algorithm is, divided by the complexity of time and the complexity of space. The time complexity refers to the amount of work required to perform the algorithm. The spatial complexity of the algorithm refers to the [storage space] required in the execution of the algorithm. The value of one item in the time complexity of the algorithm or the complexity of the space, there is no way to derive another value. 2, data structure, The data structure is divided into [logical structures] and [storage structures]. Linear and nonlinear structures are logical structures; Order, chain, and index belong to the storage structure (physical structure). The loop queue belongs to the [storage structure]. The storage structure of the data is also called the physical structure, which is the logical structure of the data in the storage form of the computer storage space. A logical structure can have multiple storage structures, and various storage structures af