CART

(0) items

Guide to Programming Logic and Design : Introductory

by
Edition:
2nd
ISBN13:

9780619063146

ISBN10:
0619063149
Format:
Paperback
Pub. Date:
10/12/2001
Publisher(s):
Course Technology

Summary

This title is a language-independent introduction to programming logic. It provides users with a language-independent, structural approach to problem-solving.

Table of Contents

Preface ix
An Overview of Computers and Logic
1(28)
Understanding Computer Components and Operations
1(4)
Understanding the Programming Process
5(4)
Understand the Problem
5(1)
Plan the Logic
6(1)
Code the Program
7(1)
Translate the Program into Machine Language
7(1)
Test the Program
8(1)
Put the Program into Production
9(1)
Understanding the Data Hierarchy
9(2)
Using Flowchart Symbols and Pseudocode Statements
11(4)
Using and Naming Variables
15(2)
Ending a Program by Using Sentinel Values
17(2)
Using the Connector
19(1)
Assigning Values to Variables
20(2)
Understanding Data Types
22(1)
Chapter Summary
23(1)
Exercises
24(5)
Understanding Structure
29(32)
Understanding Unstructured Spaghetti Code
29(2)
Understanding the Three Basic Structures
31(7)
Using the Priming Read
38(4)
Understanding the Reasons for Structure
42(2)
Recognizing Structure
44(5)
Two Special Structures---Case and Do Until
49(5)
The Case Structure
49(3)
The Do Until Loop
52(2)
Chapter Summary
54(1)
Exercises
55(6)
Modules, Hierarchy Charts, and Documentation
61(30)
Modules, Subroutines, Procedures, Functions, or Methods
61(5)
Modularization Provides Abstraction
62(1)
Modularization Allows Multiple Programmers to Work on a Problem
62(1)
Modularization Allows You to Reuse Your Work
63(1)
Modularization Makes It Easier to Identify Structures
63(3)
Modularizing a Program
66(3)
Modules Calling Other Modules
69(2)
Declaring Variables
71(2)
Creating Hierarchy Charts
73(2)
Understanding Documentation
75(1)
Output Documentation
75(6)
Input Documentation
81(4)
Completing the Documentation
85(1)
Chapter Summary
86(1)
Exercises
87(4)
Writing a Complete Program
91(20)
Understanding the Mainline Logical Flow Through a Program
91(3)
Housekeeping Tasks
94(10)
Declaring Variables
94(5)
Opening Files
99(1)
Printing Headings
100(1)
Reading the First Input Record
100(4)
Writing the Main Loop
104(3)
Performing End-Of-Job Tasks
107(1)
Chapter Summary
107(1)
Exercises
108(3)
Making Decisions
111(38)
Evaluating Boolean Expressions to Make Comparisons
111(3)
Using the Logical Comparison Operators
114(4)
Understanding And Logic
118(4)
Writing And Decisions for Efficiency
122(2)
Combining Decisions in an And Situation
124(1)
Avoiding Common Errors in an And Situation
125(2)
Understanding Or Logic
127(2)
Avoiding Common Errors in an OR Situation
129(1)
Writing Or Decisions for Efficiency
130(1)
Combining Decisions in an Or Situation
131(1)
Using Selections within Ranges
132(1)
Common Errors Using Range Checks
133(2)
Using Decision Tables
135(7)
Chapter Summary
142(1)
Exercises
143(6)
Looping
149(28)
Using a While Loop with a Loop Control Variable
150(2)
Using a Counter to Control Looping
152(4)
Looping with a Variable Sentinel Value
156(2)
Looping by Decrementing
158(1)
Avoiding Common Loop Mistakes
159(2)
Using the For Loop
161(2)
Using the Do Until Loop
163(2)
Recognizing the Characteristics Shared by All Loops
165(1)
Nesting Loops
166(2)
Using a Loop to Accumulate Totals
168(4)
Chapter Summary
172(1)
Exercises
173(4)
Control Breaks
177(32)
Understanding Control Break Logic
177(1)
Performing Single-Level Control Breaks
178(6)
Using Control Data Within the Control Break Module
184(5)
Performing Control Breaks with Totals
189(5)
Performing Multiple-Level Control Breaks
194(8)
Performing Page Breaks
202(3)
Chapter Summary
205(1)
Exercises
206(3)
Arrays
209(1)
Understanding Arrays
209(1)
How Arrays Occupy Computer Memory
210(1)
Manipulating an Array to Replace Using Nested Decisions
211(10)
Array Declaration and Initialization
221(2)
Run-Time and Compile-Time Arrays
223(3)
Loading an Array from a File
226(2)
Searching for an Exact Match in an Array
228(2)
Using Parallel Arrays
230(3)
Remaining within Array Bounds
233(2)
Improving Search Efficiency using an Early Exit
235(2)
Searching an Array for a Range Match
237(3)
Chapter Summary
240(1)
Exercises
241
Appendix A 1(1)
Appendix B 1(1)
Index 1


Please wait while the item is added to your cart...