1 / 26

Programming Life Cycle

Programming Life Cycle. Problem analysis understand the problem Requirements definition specify what program will do High- and low-level design how it meets requirements Implementation of design code it Testing and verification detect errors, show correct Delivery turn over to customer

caia
Download Presentation

Programming Life Cycle

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Programming Life Cycle • Problem analysisunderstand the problem • Requirements definitionspecify what program will do • High- and low-level designhow it meets requirements • Implementation of designcode it • Testing and verificationdetect errors, show correct • Deliveryturn over to customer • Operation use the program • Maintenancechange the program

  2. Software Engineering • A disciplined approach to the design, production, and maintenance of computer programs • that are developed on time and within cost estimates, • using tools that help to manage the size and complexity of the resulting software products.

  3. An Algorithm Is . . . • A logical sequence of discrete steps that describes a complete solution to a given problem computable in a finite amount of time.

  4. Goals of Quality Software • It works. • It can be read and understood. • It can be modified. • It is completed on time and within budget.

  5. Detailed Program Specification • Tells what the program must do, but not how it does it. • Is written documentation about the program.

  6. Specification Includes • Inputs • Outputs • Processing requirements • Assumptions

  7. Abstraction • A model of a complex system that includes only the details essential to the perspective of the viewer of the system.

  8. Information Hiding • Hiding the details of a function or data structure with the goal of controlling access to the details of a module or structure. PURPOSE: To prevent high-level designs from depending on low-level design details that may be changed.

  9. Identifies various objects composed of data and operations, that can be used together to solve the problem. Divides theproblem intomore easily handled subtasks,until the functional modules (subproblems) can be coded. Two Design Approaches FUNCTIONALDECOMPOSITION OBJECT-ORIENTED DESIGN FOCUS ON: processes FOCUS ON: data objects

  10. Find Weighted Average Print Weighted Average Functional Design Modules Main Get Data Prepare File for Reading Print Data Print Heading

  11. Object-Oriented Design A technique for developing a program in which the solution is expressed in terms of objects -- self- contained entities composed of data and operations on that data. cin cout << >> setf get Private data Private data . . . . . . ignore

  12. More about OOD • Languages supporting OOD include: C++, Java, Smalltalk, Eiffel, and Object-Pascal. • Aclass is a programmer-defined data type and objects are variables of that type. • In C++, cin is an object of a data type (class) named istream, and cout is an object of a class ostream. Header files iostream.h and fstream.h contain definitions of stream classes.

  13. Procedural vs. Object-Oriented Code “Read the specification of the software you want to build. Underline the verbs if you are after procedural code, the nouns if you aim for an object-oriented program.” Brady Gooch, “What is and Isn’t Object Oriented Design,” 1989.

  14. Program Verification • Program Verification is the process of determining the degree to which a software product fulfills its specifications. SPECIFICATIONS Inputs Outputs Processing Requirements Assumptions PROGRAM

  15. Verification vs. Validation Program verification asks, “Are we doing the job right?” Program validation asks, “Are we doing the right job?” B. W. Boehm, Software Engineering Economics, 1981.

  16. DATA SET 1 DATA SET 2 DATA SET 3 Program Testing • Testing is the process of executing a program with various data sets designed to discover errors. DATA SET 4 . . .

  17. Various Types of Errors • Design errors occur when specifications are wrong • Compile errors occur when syntax is wrong • Run-time errors result from incorrect assumptions, incomplete understanding of the programming language, or unanticipated user errors.

  18. Robustness • Robustness is the ability of a program to recover following an error; the ability of a program to continue to operate within its environment.

  19. An Assertion • Is a logical proposition that is either true or false (not necessarily in C++ code). EXAMPLES studentCount is greater than 0 sum is assigned && count > 0 response has value ‘y’ or ‘n’ partNumber == 5467

  20. Preconditions and Postconditions • The precondition is an assertion describing what a function requires to be true before beginning execution. • The postcondition describes what must be true at the moment the function finishes execution. • The caller is responsible for ensuring the precondition, and the function code must ensure the postcondition. FOR EXAMPLE . . .

  21. void PrintList ( ofstream& dataFile, UnsortedType list) // Pre: list has been initialized. // dataFile is open for writing. // Post: Each component in list has been written to dataFile. // dataFile is still open. { int length; ItemType item; list.ResetList(); length = list.LengthIs(); for (int counter = 1; counter <= length; counter++) { list.GetNextItem(item); item.Print(dataFile); } } 35

  22. Another Example void GetRoots (float a, float b, float c, float& Root1, float& Root2 ) // Pre: a, b, and c are assigned. // a is non-zero, b*b - 4*a*c is non-zero. // Post: Root1 and Root2 are assigned // Root1 and Root2 are roots of quadratic with coefficients a, b, c { float temp; temp = b * b - 4.0 * a * c; Root1 = (-b + sqrt(temp) ) / ( 2.0 * a ); Root2 = (-b - sqrt(temp) ) / ( 2.0 * a ); return; }

  23. A Walk-Through • Is a verification method using a team to perform a manual simulation of the program or design, using sample test inputs, and keeping track of the program’s data by hand. • Its purpose is to stimulate discussion about the programmer’s design or implementation .

  24. Tasks within each test case: • determine inputs that demonstrate the goal. • determine the expected behavior for the input. • run the program and observe results. • compare expected behavior and actual behavior. If they differ, we begin debugging.

  25. Integration Testing • Is performed to integrate program modules that have already been independently unit tested. Main Get Data Prepare File for Reading Find Weighted Average Print Weighted Average Print Data Print Heading

  26. Integration Testing Approaches TOP-DOWN BOTTOM-UP Designed to ensure individual modules work together correctly, beginning with the lowest levels first. (the details) Designed to ensure correct overall design logic. (the big picture) USES: placeholder modules USES: a test driver to call called “stubs” to test the the functions being tested. order of calls.

More Related