归纳的一些东西（Something summed up）.docVIP

归纳的一些东西（Something summed up） Physical design phase: mainly solve the choice of file storage structure and determine file access methods, including the selection of storage structure, determine access methods, select access path, determine the location of data storage. 1, data structure problems: A, the storage structure of data, also known as the physical structure of data, is the storage structure of the logical structure of data in the computer. The storage structure of data consists of sequential structure, chain structure, hash structure and index structure. A data structure can be used according to the needs of different presence structure, the commonly used storage structure has sequential and chain structure. Using different storage structures, the processing efficiency is different. B, the logical structure of data, the root mean is to reflect the logical relationship between data, and storage structure is used to reflect the logical structure of the data stored in the computer storage space. The circular queue mainly emphasizes the relationship between data, so it belongs to logical structure. In C, one end of the queue that allows the insertion is called the tail of the queue, allowing the deleted end to be called the header. D, (example) in a capacity of 32 circular queue, if the head pointer is front = 3, rear = 2, the total ____ circular queue element. Problem solving: set the queue capacity to m, and if: rearfront, then the number of elements in the queue is rear-front; if rearfront, then the number of elements in the queue is m+ (rear-front). Then m= (32+ (2-3)) =31. E, sort: exchange sorting method refers to the use of a method of data exchange between the elements are sorted, including bubble and fast is a kind of exchange the most simple sorting method, it believe that elements of the exchange, will gradually become orderly linear form. The style of F and program reading mainly emphasizes the simplicity, clarity and understandability of the program