C语言数据结构设计1.

Chapter 1 PROGRAMMING PRINCIPLES1. Introduction:Problems with large programs2. The Game of Life (acontinuing example3. Programming style(aNames(bDocumentation and format(cRefinement and modularity4. Coding, testing, and further refinement (aStubs(bInput and Output(cDrivers(dProgram Testing5. ReferencesProblems of Large Programs1. The patchwork approach2. Problem specification3. Program organization4. Data organization and data structures5. Algorithm selection and analysis6. Debugging7. Testing8. MaintenanceRules for the Game of Life1. The neighbors of a given cell are the eight cells that touch it vertically, horizontally, or diagonally. Every cell is either living or dead.2. A living cell stays alive in the next generation if it has either 2or 3living neighbors; it dies if it has 0, 1, 4, or more living neighbors.3. A dead cell becomes alive in the next generation if it has ex-actly three neighboring cells, no more or fewer, that are al-ready alive. All other dead cells remain dead in the next gen-eration.4. All births and deaths take place at exactly the same time, so that a dying cell can help to give birth to another, but cannot prevent the death of others by reducing overcrowding, nor can cells being born either preserve or kill cells living in the previous generation.andExamples of Life Configurations(j(k(lAlgorithm for the Life GameInitialize an array called map to contain the initial configuration of living cells.Repeat the following steps for as long as desired:For each cell in the array do the following:Count the number of living neighbors of the cell.If the count is 0, 1, 4, 5, 6, 7, or 8, then set the corresponding cell in another array called newmap to be dead; if the count is 3, then set the corresponding cell to be alive; and if the count is 2, then set the corresponding cell to be the same as the cell in array map (sincethe status of a cell with count 2does not change.Copy the array newmap into the array map .Print the array map for the user.Guidelines for Choosing Names1. Give special care to the choice of names for functions, con-stants, and all global variables and types used in different parts of the program.2. Keep the names simple for variables used only briefly and locally.3. Use common prefixes or suffixes to associate names of the same general category.4. Avoid deliberate misspellings and meaningless suffixes to ob-tain different names.5. Avoid choosing cute names whose meaning has little or noth-ing to do with the problem.6. Avoid choosing names that are close to each other in spelling or otherwise easy to confuse.7. Be careful in the use of the letter “ l ” (smallell, “ O ” (capital oh and “ 0” (zero.Programming PreceptAlways name your variables and functionswith the greatest care, and explain them thoroughly.Documentation Guidelines1. Place a prologue at the beginning of each function with(aIdentification (programmer’s name, date, version.(bStatement of the purpose of the function and method used.(cChanges the function makes and what data it uses.(dReference to further documentation for the program. 2. When each variable, constant, or type is declared, explain what it is and how it is used.3. Introduce each significant part of the program with a state-ment of purpose.4. Indicate the end of each significant section.5. Avoid comments that parrot what the code does or that are meaningless jargon.6. Explain any statement that employs a trick or whose meaning is unclear. Better still, avoid such statements.7. The code itself should explain how the program works. The documentation should explain why it works and what it does. 8. Be sure to modify the documentation along with the program.Programming PreceptKeep your documentation concise but descriptive.Programming PreceptThe reading time for programs is much more than the writing time. Make reading easy to do.Refinement and Modularity Top-down design and refinement:Programming PreceptDon’t lose sight of the forest for its trees. Division of work among functions:Programming PreceptEach function should do only one task, but do it well. Programming PreceptEach function should hide something. Programming PreceptInclude precise preconditions and postconditions with every function that you write.Categories of Data Used inFunctionsInputparametersOutputparametersInoutparametersLocalvariablesGlobal variablesProgramming PreceptKeep your connections simple. Avoid global variables whenever possible. Programming PreceptNever cause side effects if you can avoid it.If you must use global variables, document them thoroughly. Programming PreceptKeep your input and output as separate functions,so they can be changed easilyand can be custom-tailored to your computing system.Debugging and Testing Methods for debugging: 1. Structured walkthrough 2. Snapshots 3. Scaffolding 4. Static analyzer Programming Precept The quality of test data is more important than its quantity. Programming Precept Program testing can be used to show the presence of bugs, but never their absence. Methods for program testing: 1. The black-box method: (a Easy values (b Typical, realistic values (c Extreme values (d Illegal values 2. The glass-box method: Trace all the paths through the program. 3. The ticking-box method: Don’t do anything—Just hope for the best! Debugging and Testing Transp. 11, Sect. 1.4, Coding, Testing, and Further Renement 239 1997 Prentice-Hall, Inc., Upper Saddle River, N.J. 07458 Data Structures and Program Design In C, 2nd. ed.Execution Paths switch a { case 1: x = 3; break; case 2: if (b == 0 x = 2; else x = 3; x = 4; break; case 3: while (c > 0 process (c; break; } a == 1 a == 2 b == 0 b != 0 a == 3 x = 2; x = 4; while (c > 0 process (c; a == 1 a == 2 b == 0 a == 2 b != 0 a == 3 x = 3; x = 2; x = 4; while (c > 0 process (c; Path 1 Path 2 Path 3 Path 4 Execution Paths Transp. 12, Sect.1.4, Coding, Testing, and Further Renement 240 1997 Prentice-Hall, Inc., Upper Saddle River, N.J. 07458 Data Structures and Program Design In C, 2nd. ed.R Pentomino Cheshire Cat Virus Tumbler Barber Pole Harvester The Glider Gun Life congurations Transp. 13, Sect. 1.4, Coding, Testing, and Further Renement 241 1997 Prentice-Hall, Inc., Upper Saddle River, N.J. 07458 Data Structures and Program Design In C, 2nd. ed.Pointers and Pitfalls 1. Understand your problem before you decide how to solve it.2. Understand the algorithmic method before you start to program.3. Divide the problem into pieces and think of each part separately.4. Keep your functions short and simple.5. Include careful documentation with each function.6. Write down precise preconditions and postconditions for every function.7. Include error checking to check that the preconditions hold.8. Every time you use a function, verify that its preconditions will hold.9. Use stubs and drivers, black-box and glass-box testing. 10. Use plenty of scaffolding to help localize errors. 11. In programming with arrays, be wary of index values that are off by 1. 12. Keep your programs well-formatted as you write them. 13. Keep your documentation consistent with your code. 14. Explain your program to somebody else. 15. Remember the Programming Precepts! Pointers and Pitfalls Transp. 14, Chapter 1, Programming Principles 242 1997 Prentice-Hall, Inc., Upper Saddle River, N.J. 07458 Data Structures and Program Design In C, 2nd. ed.。