Chapter 6 Modular Programming Dr. J.-Y. Pan Dept. Comm. Eng.

Slides:



Advertisements
Similar presentations
Etter/Ingber Engineering Problem Solving with C Fundamental Concepts Chapter 4 Modular Programming with Functions.
Advertisements

© 2010 Pearson Addison-Wesley. All rights reserved. Addison Wesley is an imprint of Chapter 6: Modular Programming Problem Solving & Program Design in.
Chapter 6 Modular Programming J. H. Wang ( 王正豪 ), Ph. D. Assistant Professor Dept. Computer Science and Information Engineering National Taipei University.
Chapter 7: User-Defined Functions II Instructor: Mohammad Mojaddam.
Lecture 2 Introduction to C Programming
Introduction to C Programming
Computer Programming Lecture 13 Functions with Multiple Output Parameters Assist.Prof.Dr. Nükhet ÖZBEK Ege University Department of Electrical & Electronics.
Chapter 6 Modular Programming Dr. J.-Y. Pan Dept. Comm. Eng. Nat. Chung Cheng Univ.
1 ICS103 Programming in C Lecture 3: Introduction to C (2)
Chapter 3 Top-Down Design with Functions Dr. J.-Y. Pan Dept. Comm. Eng. Nat. Chung Cheng Univ.
Function with Output Parameters 4 We have seen that functions can return a single value or no value (void return type) 4 It is quite often useful to be.
Program Design and Development
 2007 Pearson Education, Inc. All rights reserved Introduction to C Programming.
TDBA66, VT-03, Lecture - Ch6_21 Function calls A function call implies –Every expression in the argument list is evaluated –If necessary, the value of.
CS 201 Functions Debzani Deb.
1 CSC 1401 S1 Computer Programming I Hamid Harroud School of Science and Engineering, Akhawayn University
Introduction to C Programming
Basic Elements of C++ Chapter 2.
CMSC 104, Version 8/061L18Functions1.ppt Functions, Part 1 of 4 Topics Using Predefined Functions Programmer-Defined Functions Using Input Parameters Function.
Functions in C. Function Terminology Identifier scope Function declaration, definition, and use Parameters and arguments Parameter order, number, and.
CSCI 1730 January 17 th, 2012 © by Pearson Education, Inc. All Rights Reserved.
Modular Programming Chapter Value and Reference Parameters t Function declaration: void computesumave(float num1, float num2, float& sum, float&
INTRODUCTION TO PROGRAMMING STRUCTURE Chapter 4 1.
CP104 Introduction to Programming Modular Programming Lecture 16__ 1 Modular Programming II Functions with single output Functions with multiple outputs.
Modular Programming Chapter Value and Reference Parameters computeSumAve (x, y, sum, mean) ACTUALFORMAL xnum1(input) ynum2(input) sumsum(output)
Chapter 2 Overview of C Part I J. H. Wang ( 王正豪 ), Ph. D. Assistant Professor Dept. Computer Science and Information Engineering National Taipei University.
Chapter 6: User-Defined Functions
C++ Programming: From Problem Analysis to Program Design, Fifth Edition, Fifth Edition Chapter 7: User-Defined Functions II.
Modular Programming Advantages of using functions (to make a modular program) are: Changing the program into separate pieces Code reusing Easier modification.
Chapter 13 Programming in the Large Dr. Jiung-yao Huang Dept. Comm. Eng. Nat. Chung Cheng Univ. TA: 鄭筱親 陳昱豪.
C++ Programming Language Lecture 2 Problem Analysis and Solution Representation By Ghada Al-Mashaqbeh The Hashemite University Computer Engineering Department.
Chapter 3 Top-Down Design with Functions Part II J. H. Wang ( 王正豪 ), Ph. D. Assistant Professor Dept. Computer Science and Information Engineering National.
Overview of C. C—a high-level programming language developed in 1972 by Dennis Ritchie at AT&T Bell Laboratories. We will discuss: –the elements of a.
Review 1 List Data Structure List operations List Implementation Array Linked List.
Chapter 3 Functions. 2 Overview u 3.2 Using C++ functions  Passing arguments  Header files & libraries u Writing C++ functions  Prototype  Definition.
Lecture 17: Modular Programming (cont) Debugging and Debuggers.
Chapter 3 : Top Down Design with Functions By Suraya Alias.
1 ICS103 Programming in C Lecture 8: Functions I.
Chapter 3: User-Defined Functions I
CISC105 – General Computer Science Class 2 – 6/7/2006.
The Hashemite University Computer Engineering Department
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 6: Modular Programming Problem Solving and Program Design in C 5th.
Building Programs from Existing Information Solutions for programs often can be developed from previously solved problems. Data requirements and solution.
Chapter 7 Modularity Using Functions: Part II. A First Book of ANSI C, Fourth Edition 2 Variable Scope If variables created inside a function are available.
A First Book of ANSI C Fourth Edition
Chapter 12 Text and Binary File Processing Dr. Jiung-yao Huang Dept. Comm. Eng. Nat. Chung Cheng Univ. TA: 鄭筱親 陳昱豪.
Introduction to Algorithmic Processes CMPSC 201C Fall 2000.
Problem Solving and Program Design in C Chap. 6 Pointers and Modular Programming Chow-Sing Lin.
CCSA 221 Programming in C CHAPTER 3 COMPILING AND RUNNING YOUR FIRST PROGRAM 1 ALHANOUF ALAMR.
Chapter 9: Value-Returning Functions
Chapter Topics The Basics of a C++ Program Data Types
Chapter 6: User-Defined Functions I
Chapter 7: User-Defined Functions II
Completing the Problem-Solving Process
Chapter 6: Modular Programming
Basic Elements of C++.
ICS103 Programming in C Lecture 3: Introduction to C (2)
The Selection Structure
Stacks Chapter 4.
User-Defined Functions
Basic Elements of C++ Chapter 2.
Functions.
1) C program development 2) Selection structure
Assist.Prof.Dr. Nükhet ÖZBEK Ege University
Chapter 6 Modular Programming chap6.
Top-Down Design with Functions
ICS103: Programming in C 6: Pointers and Modular Programming
Top-Down Design with Functions
Presentation transcript:

Chapter 6 Modular Programming Dr. J.-Y. Pan Dept. Comm. Eng. Nat. Chung Cheng Univ. http://ant.comm.ccu.edu.tw jypan@comm.ccu.edu.tw

本章重點 Pointer Name scope Testing skill

If a reference x is of type “whatever-type”, the reference &x is of type “pointer to whatever-type,” that is, “whatever-type *.”

Figure 6.5 Comparison of Direct and Indirect Reference

6.1 (cont) Meaning of * Symbol Three distinct meanings of the symbol * Multiplication 3 * x + 4 (expression) Part of the names of the parameters’ data types pointer to char *signp; (declaration) Unary indirection operator follow the pointer *signp = ‘+’; (execution statement)

6.1 Function With Output Parameter Argument lists provide the communication links between the main function and its function subprograms. Arguments enable a function to manipulate different data each time it is called. When a function call executes, the computer allocates memory space in the function data area for each formal parameter. The value of each actual parameter is stored in the memory cell allocated to its corresponding formal parameter.

Figure 6.1 Function separate

Pointer A memory cell whose content is the address of another memory cell Fig 1.4 Fig 3.15 Actual & Formal

6.2 Multiple Calls to a Function with Input/Output Parameters sort A rearrangement of data in a particular sequence (increasing or decreasing) Example 6.2 The main function in Fig. 6.6 gets three data values and rearranges the data in increasing sequence.

Figure 6.6 Program to Sort Three Numbers

Figure 6.6 Program to Sort Three Numbers (cont’d) Comparing to p.164, Fig 4.5

6.2 (cont) Trace of Program to Sort Three Numbers Statement num1 num2 num3 Effect scanf(“...”, &num1, &num2, &num3); 7.5 9.6 5.5 Enter data Order(&num1, &num2); No change Order(&num1, &num3); Switch Order(&num2, &num3); printf(“...”, num1, num2, num3) Display

Figure 6. 7 Data Areas After temp = Figure 6.7 Data Areas After temp = *smp; During Call order(&num1, &num3);

Program Style Functions that return a single value are the easiest functions for a program reader to deal with. If a function subprogram has a meaningful name, the reader can often get a good idea of what is happening in the calling function.

6.3 Scope of Names The scope of a name refers to the region of a program where a particular meaning of a name is visible or can be referenced. Name is defined as constant macros and their scope begins at their definition and continues to the end of the source file.

Figure 6.8 Outline of Program for Studying Scope of Names

Scope of Names Use in Fig. 6.8

6.4 Formal Output Parameters as Actual Arguments Fig. 6.9 shows a function that scans a data line representing a common fraction of the form numerator / denominator Numerator is an integer Denominator is a positive integer Figure 6.10 shows the data areas for scan_fraction and the function calling it.

Figure 6.9 Function scan_fraction nump &slash denomp Driver: Fig 6.15

Figure 6.10 Data Areas for scan_fraction and Its Caller

6.5 A Program with Multiple Functions CASE STUDY Arithmetic with Common Fractions

6.5 (cont) Case Study: Arithmetic with Common Fractions Design Initial Algorithm 1.Repeat as log as user wants to continue 2. Get a fraction problem 3. Compute the result 4. Display problem and result 5. Check if user wants to continue Refinement 2.1 Get first fraction 2.2 Get operator 2.3 Get second fraction

6.5 (cont) Case Study: Arithmetic with Common Fractions Design Refinement 3.1 Select a task based on operator 3.1.2 Add the fractions 3.1.3 Add the first fraction and the negation of the second 3.1.4 Multiply the fractions 3.1.5 Multiply the first fraction and the reciprocal of the second 3.2 Put the result fraction in reduced form

6.5 (cont) Case Study: Arithmetic with Common Fractions Design Refinement of 3.2 3.2.1 Find the greatest common divisor (gcd) of the numerator and denominator 3.2.2 Divide the numerator and denominator by the gcd Fig. 6.11 shows the data flow among the steps

Figure 6.11 Structure Chart for Common Fraction Problem HW5

6.5 (cont) Case Study: Arithmetic with Common Fractions Implementation (Figure 6.12) stub A skeleton function that consists of a header and statements that display trace messages and assign values to output parameters Enables testing of the flow of control among functions before this function is completed multiply_fractions and find_gcd use stubs

Figure 6.12 Program to Perform Arithmetic Operations on Common Fractions 直接看程式…

Figure 6.12 Program to Perform Arithmetic Operations on Common Fractions (cont’d)

Figure 6.12 Program to Perform Arithmetic Operations on Common Fractions (cont’d)

Figure 6.12 Program to Perform Arithmetic Operations on Common Fractions (cont’d)

Figure 6.12 Program to Perform Arithmetic Operations on Common Fractions (cont’d)

Figure 6.12 Program to Perform Arithmetic Operations on Common Fractions (cont’d)

Figure 6.13 Sample Run of a Partially Complete Program Containing Stubs

Testing (Figure 6.13) Insert a stub for each function not yet completed Each stub prints an identification message and assigns values to its output parameters

6.6 Debugging and Testing a Program System The number of statements in a program system grows, the possibility of error also increases. keep each function to a manageable size Top-down testing the process of testing flow of control between a main function and its subordinate functions Bottom-up testing The process of separately testing individual functions of a program system Unit test A test of an individual function System integration tests Testing a system after replacing all its stubs with functions that have been pretested

Figure 6.15 Driver for Function scan_fraction A short function written to test another function by defining its arguments, calling it, and displaying its result.

6.6 (cont) Debugging Tips for Program Systems Carefully document each function parameter and local variable using comments. Create a trace of execution by displaying names Trace or display the values of all input and input/output parameters Trace or display the values of all function outputs after returning from a function Make sure that a function stub assigns a value to the variable pointed to by each output parameter Use “step into” and “step over” in debugger

6.7 Common Programming Errors N O T Beware of name scope and life time Is there any identifier referenced outside its scope? Does the identifier refer to what you want to? …