Download presentation
Presentation is loading. Please wait.
Published byGerald Barton Modified over 8 years ago
1
© 2012 Pearson Addison-Wesley. All rights reserved. Addison Wesley is an imprint of Chapter 3: Top-Down Design with Functions Problem Solving & Program Design in C Seventh Edition By Jeri R. Hanly & Elliot B. Koffman
2
1-2 © 2012 Pearson Addison-Wesley. All rights reserved. 1-2 Figure 3.1 Edited Data Requirements and Algorithm for Conversion Program
3
1-3 © 2012 Pearson Addison-Wesley. All rights reserved. 1-3 Figure 3.2 Outline of Program Circle
4
1-4 © 2012 Pearson Addison-Wesley. All rights reserved. 1-4 Figure 3.3 Calculating the Area and the Circumference of a Circle
5
1-5 © 2012 Pearson Addison-Wesley. All rights reserved. 1-5 Figure 3.3 Calculating the Area and the Circumference of a Circle (cont’d)
6
1-6 © 2012 Pearson Addison-Wesley. All rights reserved. 1-6 Figure 3.4 Computing the Rim Area of a Flat Washer
7
1-7 © 2012 Pearson Addison-Wesley. All rights reserved. 1-7 Figure 3.5 Flat Washer Program
8
1-8 © 2012 Pearson Addison-Wesley. All rights reserved. 1-8 Figure 3.5 Flat Washer Program (cont’d)
9
1-9 © 2012 Pearson Addison-Wesley. All rights reserved. 1-9 Figure 3.6 Function sqrt as a “Black Box”
10
1-10 © 2012 Pearson Addison-Wesley. All rights reserved. 1-10 Figure 3.7 Square Root Program
11
1-11 © 2012 Pearson Addison-Wesley. All rights reserved. 1-11 Figure 3.7 Square Root Program (cont’d)
12
1-12 © 2012 Pearson Addison-Wesley. All rights reserved. 1-12 Figure 3.9 House and Stick Figure
13
1-13 © 2012 Pearson Addison-Wesley. All rights reserved. 1-13 Figure 3.10 Structure Chart for Drawing a Stick Figure
14
1-14 © 2012 Pearson Addison-Wesley. All rights reserved. 1-14 Figure 3.11 Function Prototypes and Main Function for Stick Figure
15
1-15 © 2012 Pearson Addison-Wesley. All rights reserved. 1-15 Figure 3.12 Function draw_circle
16
1-16 © 2012 Pearson Addison-Wesley. All rights reserved. 1-16 Figure 3.13 Function draw_triangle
17
1-17 © 2012 Pearson Addison-Wesley. All rights reserved. 1-17 Figure 3.14 Program to Draw a Stick Figure
18
1-18 © 2012 Pearson Addison-Wesley. All rights reserved. 1-18 Figure 3.14 Program to Draw a Stick Figure (cont’d)
19
1-19 © 2012 Pearson Addison-Wesley. All rights reserved. 1-19 Figure 3.14 Program to Draw a Stick Figure (cont’d)
20
1-20 © 2012 Pearson Addison-Wesley. All rights reserved. 1-20 Figure 3.15 Flow of Control Between the main Function and a Function Subprogram
21
1-21 © 2012 Pearson Addison-Wesley. All rights reserved. 1-21 Figure 3.16 Function instruct and the Output Produced by a Call
22
1-22 © 2012 Pearson Addison-Wesley. All rights reserved. 1-22 Figure 3.18 Function print_rboxed and Sample Run
23
1-23 © 2012 Pearson Addison-Wesley. All rights reserved. 1-23 Figure 3.18 Function print_rboxed and Sample Run (cont’d)
24
1-24 © 2012 Pearson Addison-Wesley. All rights reserved. 1-24 Figure 3.19 Effect of Executing print_rboxed (135.68);
25
1-25 © 2012 Pearson Addison-Wesley. All rights reserved. 1-25 Figure 3.20 Function with Input Arguments and One Result
26
1-26 © 2012 Pearson Addison-Wesley. All rights reserved. 1-26 Figure 3.21 Functions find_circum and find_area
27
1-27 © 2012 Pearson Addison-Wesley. All rights reserved. 1-27 Figure 3.22 Effect of Executing circum = find_circum (radius);
28
1-28 © 2012 Pearson Addison-Wesley. All rights reserved. 1-28 Figure 3.23 Function scale
29
1-29 © 2012 Pearson Addison-Wesley. All rights reserved. 1-29 Figure 3.24 Testing Function scale
30
1-30 © 2012 Pearson Addison-Wesley. All rights reserved. 1-30 Figure 3.25 Data Areas After Pass by Value Call scale(num_1, num_2);
31
1-31 © 2012 Pearson Addison-Wesley. All rights reserved. 1-31 Figure 3.26 Referencing pixels in a window
32
1-32 © 2012 Pearson Addison-Wesley. All rights reserved. 1-32 Figure 3.27 Drawing intersecting lines
33
1-33 © 2012 Pearson Addison-Wesley. All rights reserved. 1-33 Figure 3.28 Window drawn by lines.c
34
1-34 © 2012 Pearson Addison-Wesley. All rights reserved. 1-34 Figure 3.29 Drawing a house
35
1-35 © 2012 Pearson Addison-Wesley. All rights reserved. 1-35 Figure 3.30 House drawn by house.c
36
© 2012 Pearson Addison-Wesley. All rights reserved. Addison Wesley is an imprint of Chapter 4: Selection Structures: if and switch Statements Problem Solving & Program Design in C Seventh Edition By Jeri R. Hanly & Elliot B. Koffman
37
1-37 © 2012 Pearson Addison-Wesley. All rights reserved. 1-37 Figure 4.1 Evaluation Tree and Step-by- Step Evaluation for !flag || (y + z >= x - z)
38
1-38 © 2012 Pearson Addison-Wesley. All rights reserved. 1-38 Figure 4.2 Range of True Values for min <= x && x <= max
39
1-39 © 2012 Pearson Addison-Wesley. All rights reserved. 1-39 Figure 4.3 Range of True Values for z > x || x > y
40
1-40 © 2012 Pearson Addison-Wesley. All rights reserved. 1-40 Figure 4.4 Flowcharts of if Statements with (a) Two Alternatives and (b) One Alternative
41
1-41 © 2012 Pearson Addison-Wesley. All rights reserved. Figure 4.5 Program Using an if statement for selection 1-41
42
1-42 © 2012 Pearson Addison-Wesley. All rights reserved. 1-42 Figure 4.6 if Statement to Order x and y
43
1-43 © 2012 Pearson Addison-Wesley. All rights reserved. 1-43 Figure 4.7 Structure Chart for Water Bill Problem
44
1-44 © 2012 Pearson Addison-Wesley. All rights reserved. 1-44 Figure 4.8 Program for Water Bill Problem
45
1-45 © 2012 Pearson Addison-Wesley. All rights reserved. 1-45 Figure 4.8 Program for Water Bill Problem (cont’d)
46
1-46 © 2012 Pearson Addison-Wesley. All rights reserved. 1-46 Figure 4.8 Program for Water Bill Problem (cont’d)
47
1-47 © 2012 Pearson Addison-Wesley. All rights reserved. 1-47 Figure 4.8 Program for Water Bill Problem (cont’d)
48
1-48 © 2012 Pearson Addison-Wesley. All rights reserved. 1-48 Figure 4.9 Sample Run of Water Bill Program
49
1-49 © 2012 Pearson Addison-Wesley. All rights reserved. 1-49 Figure 4.10 Function comp_use_charge Revised
50
1-50 © 2012 Pearson Addison-Wesley. All rights reserved. 1-50 Figure 4.10 Function comp_use_charge Revised (cont’d)
51
1-51 © 2012 Pearson Addison-Wesley. All rights reserved. 1-51 Figure 4.11 Function comp_tax
52
1-52 © 2012 Pearson Addison-Wesley. All rights reserved. 1-52 Figure 4.12 Flowchart of Road Sign Decision Process
53
1-53 © 2012 Pearson Addison-Wesley. All rights reserved. 1-53 Figure 4.13 Program Using a switch Statement for Selection Can we remove the break statements? Try it out?
54
1-54 © 2012 Pearson Addison-Wesley. All rights reserved. 1-54 Figure 4.13 Program Using a switch Statement for Selection (cont’d)
55
© 2012 Pearson Addison-Wesley. All rights reserved. Addison Wesley is an imprint of Chapter 5: Repetition and Loop Statements Problem Solving & Program Design in C Seventh Edition By Jeri R. Hanly & Elliot B. Koffman
56
1-56 © 2012 Pearson Addison-Wesley. All rights reserved. 1-56 Figure 5.1 Flow Diagram of Loop Choice Process
57
1-57 © 2012 Pearson Addison-Wesley. All rights reserved. 1-57 Figure 5.2 Program Fragment with a Loop
58
1-58 © 2012 Pearson Addison-Wesley. All rights reserved. 1-58 Figure 5.3 Flowchart for a while Loop
59
1-59 © 2012 Pearson Addison-Wesley. All rights reserved. Figure 5.4 Program to Compute Company Payroll 1-59
60
1-60 © 2012 Pearson Addison-Wesley. All rights reserved. Figure 5.4 Program to Compute Company Payroll (cont’d) 1-60
61
1-61 © 2012 Pearson Addison-Wesley. All rights reserved. 1-61 Figure 5.5 Using a for Statement in a Counting Loop
62
1-62 © 2012 Pearson Addison-Wesley. All rights reserved. 1-62 Figure 5.6 Comparison of Prefix and Postfix Increments
63
1-63 © 2012 Pearson Addison-Wesley. All rights reserved. 1-63 Figure 5.7 Function to Compute Factorial
64
1-64 © 2012 Pearson Addison-Wesley. All rights reserved. 1-64 Figure 5.13 Nested Counting Loop Program
65
1-65 © 2012 Pearson Addison-Wesley. All rights reserved. 1-65 Figure 5.14 Validating Input Using do-while Statement
66
1-66 © 2012 Pearson Addison-Wesley. All rights reserved. Assignment 1 Write a program that computes and displays the sum of a collection of Celsius temperatures entered at the terminal until a sentinel value of -275 is entered. 1-66
67
1-67 © 2012 Pearson Addison-Wesley. All rights reserved. Self Study Other variations of writing for loops: –Can we write “for (;;) {}” How to use break and continue statements in loops? Can functions returning void use the return statement? if yes, how? 1-67
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.