Course design content and arrangement

$1.$ Problem analysis and task definition

According to the requirements of the design topic, fully analyze and understand the problem, and clarify what the problem requires. $($And not how?$)$ What are the restrictions?

$2.$ Logical design

Define the corresponding data types for the operation objects involved in the problem description, divide the modules according to the principle of data structure, and define the main program modules and each abstract data type. The result of the logical design should be the definition of each abstract data type $($including the description of the data structure and the functional description of each basic operation$),$ the algorithm of each major module, and the invocation diagram between the modules.

$3.$ Physical design

Define the corresponding storage structure and write out the pseudo$-$code algorithm for each function. In this process, the system functions should be comprehensively considered, so that the system structure is clear, reasonable, simple and easy to debug, the implementation of abstract data types should be data encapsulation as much as possible, and the specifications of basic operations should be as clear and specific as possible. The result of the detailed design is to further refine the data structure and basic operations, write the type definition of the data storage structure, and write the algorithm framework in the form of functions.

$4.$ Program coding

The results of the detailed design are further refined into programming language programs. At the same time, some annotations and assertions are added to make the logical concepts in the program clear.

$5.$ Program debugging and testing

It is carried out from the bottom up and divided into modules, that is$,$ the low$-$level functions are debugged first. Be proficient in the various functions of debugging tools, design test data to identify doubts, and modify programs to confirm or bypass them. After the debugging is correct, carefully organize the source program and its comments, and form a well$-$formatted and stylish source program list and results.

$6.$ Result analysis

The results of the program include the correct input and its output results and the input and output results containing errors, and briefly analyze the temporal and spatial complexity of the algorithm.

$7.$ Prepare a course design report Problem:$---$ Address book with Hashing.

Design an address book $($hashing based searching supported$)$

Requirements:

$1)$Each record has the basic item$$ user name, phone number, mobile phone number$$address$,$

memo$$

$2)$ The address book is initialized from a XSV file.

$3)$ use $($mobile$)$ phone number and user name item respectively as the keywords and build the

index with hashing$$

$4$Support searching with the user name and phone number or mobile phone number.

$5)$ Solve the collision$$