CART

(0) items

Guide to Programming Logic and Design : Introductory,9780619160234
This item qualifies for
FREE SHIPPING!

FREE SHIPPING OVER $59!

Your order must be $59 or more, you must select US Postal Service Shipping as your shipping preference, and the "Group my items into as few shipments as possible" option when you place your order.

Bulk sales, PO's, Marketplace Items, eBooks, Apparel, and DVDs not included.

Guide to Programming Logic and Design : Introductory

by
Edition:
3rd
ISBN13:

9780619160234

ISBN10:
0619160233
Format:
Paperback
Pub. Date:
1/12/2004
Publisher(s):
Course Technology
List Price: $67.66
More New and Used
from Private Sellers
Starting at $0.01
See Prices

Rent Textbook

We're Sorry
Sold Out

Used Textbook

We're Sorry
Sold Out

eTextbook

We're Sorry
Not Available

New Textbook

We're Sorry
Sold Out

Related Products


  • C++ Programs to Accompany Programming Logic and Design
    C++ Programs to Accompany Programming Logic and Design
  • Programming Logic and Design : Introductory
    Programming Logic and Design : Introductory
  • Programming Logic and Design Introductory (with Videos Printed Access Card)
    Programming Logic and Design Introductory (with Videos Printed Access Card)
  • Programming Logic And Design, Introductory
    Programming Logic And Design, Introductory
  • Programming Logic and Design, Introductory
    Programming Logic and Design, Introductory
  • Programming Logic and Design, Introductory
    Programming Logic and Design, Introductory
  • Programming Logic and Design, Introductory
    Programming Logic and Design, Introductory
  • Programming Logic and Design: Introductory
    Programming Logic and Design: Introductory
  • Programming Logic and Design: Introductory
    Programming Logic and Design: Introductory
  • Programming Logic and Design: Introductory, 6th Edition
    Programming Logic and Design: Introductory, 6th Edition




Table of Contents

PREFACE xi
CHAPTER ONE An Overview of Computers and Logic 1(34)
Understanding Computer Components and Operations
2(3)
Understanding the Programming Process
5(5)
Understand the Problem
6(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
10(2)
Using Flowchart Symbols and Pseudocode Statements
12(4)
Using and Naming Variables
16(2)
Ending a Program by Using Sentinel Values
18(2)
Using the Connector
20(1)
Assigning Values to Variables
21(1)
Understanding Data Types
22(2)
Understanding the Evolution of Programming Techniques
24(2)
Chapter Summary
26(1)
Key Terms
26(3)
Review Questions
29(3)
Exercises
32(3)
CHAPTER TWO Understanding Structure 35(38)
Understanding Unstructured Spaghetti Code
36(1)
Understanding the Three Basic Structures
37(7)
Using the Priming Read
44(6)
Understanding the Reasons for Structure
50(2)
Recognizing Structure
52(7)
Two Special Structures-Case and Do Until
59(5)
The Case Structure
59(1)
The Do Until Loop
60(4)
Chapter Summary
64(1)
Key Terms
64(1)
Review Questions
65(3)
Exercises
68(5)
CHAPTER THREE Modules, Hierarchy Charts, and Documentation 73(40)
Modules, Subroutines, Procedures, Functions, or Methods
74(3)
Modularization Provides Abstraction
74(1)
Modularization Allows Multiple Programmers to Work on a Problem
75(1)
Modularization Allows You to Reuse Your Work
75(1)
Modularization Makes It Easier to Identify Structures
76(1)
Modularizing a Program
77(4)
Modules Calling Other Modules
81(1)
Declaring Variables
82(2)
Creating Hierarchy Charts
84(2)
Understanding Documentation
86(1)
Output Documentation
87(7)
Input Documentation
94(5)
Completing the Documentation
99(2)
Chapter Summary
101(1)
Key Terms
101(2)
Review Questions
103(3)
Exercises
106(7)
CHAPTER FOUR Writing and Designing a Complete Program 113(36)
Understanding the Mainline Logical Flow Through a Program
114(4)
Housekeeping Tasks
118(11)
Declaring Variables
118(5)
Opening Files
123(1)
A One-Time-Only Task-Printing Headings
124(1)
Reading the First Input Record
124(5)
Writing the Main Loop
129(3)
Performing End-Of-Job Tasks
132(2)
Understanding the Need for Good Program Design
134(1)
Storing Program Components in Separate Files
135(2)
Selecting Variable and Module Names
137(1)
Designing Clear Module Statements
138(2)
Avoiding Confusing Line Breaks
138(1)
Using Temporary Variables to Clarify Long Statements
139(1)
Using Constants Where Appropriate
139(1)
Maintaining Good Programming Habits
140(1)
Chapter Summary
141(1)
Key Terms
141(1)
Review Questions
142(3)
Exercises
145(4)
CHAPTER FIVE Making Decisions 149(54)
Evaluating Boolean Expressions to Make Comparisons
150(2)
Using the Logical Comparison Operators
152(4)
Understanding AND Logic
156(10)
Writing Nested AND Decisions for Efficiency
161(2)
Combining Decisions in an AND Selection
163(1)
Avoiding Common Errors in an AND Selection
164(2)
Understanding OR Logic
166(8)
Avoiding Common Errors in an OR Selection
167(3)
Writing OR Decisions for Efficiency
170(2)
Combining Decisions in an OR Selection
172(2)
Using Selections within Ranges
174(4)
Common Errors Using Range Checks
176(2)
Understanding Precedence When Combining AND and OR Selections
178(2)
Understanding the Case Structure
180(2)
Using Decision Tables
182(8)
Chapter Summary
190(1)
Key Terms
191(1)
Review Questions
192(4)
Exercises
196(7)
CHAPTER SIX Looping 203(42)
Understanding the Advantages of Looping
204(1)
Using a While Loop with a Loop Control Variable
204(3)
Using a Counter to Control Looping
207(4)
Looping with a Variable Sentinel Value
211(2)
Looping by Decrementing
213(1)
Avoiding Common Loop Mistakes
214(3)
Neglecting to Initialize the Loop Control Variable
214(1)
Neglecting to Alter the Loop Control Variable
214(1)
Using the Wrong Comparison with the Loop Control Variable
215(1)
Including Statements Inside the Loop that Belong Outside the Loop
215(1)
Initializing a Variable That Does Not Require Initialization
216(1)
Using the For Loop
217(2)
Using the Do Until Loop
219(4)
Recognizing the Characteristics Shared by All Loops
223(1)
Nesting Loops
224(6)
Using a Loop to Accumulate Totals
230(3)
Chapter Summary
233(1)
Key Terms
233(1)
Review Questions
234(5)
Exercises
239(6)
CHAPTER SEVEN Control Breaks 245(40)
Understanding Control Break Logic
246(1)
Performing a Single-Level Control Break to Start a New Page
246(6)
Using Control Data within a Heading in a Control Break Module
252(2)
Using Control Data within a Footer in a Control Break Module
254(2)
Performing Control Breaks with Totals
256(5)
Performing Multiple-Level Control Breaks
261(6)
Performing Page Breaks
267(6)
Chapter Summary
273(1)
Key Terms
274(1)
Review Questions
275(5)
Exercises
280(5)
CHAPTER EIGHT Arrays 285
Understanding Arrays
286(1)
How Arrays Occupy Computer Memory
286(1)
Manipulating an Array to Replace Nested Decisions
287(10)
Array Declaration and Initialization
297(2)
Run-Time and Compile-Time Arrays
299(3)
Loading an Array from a File
302(2)
Searching for an Exact Match in an Array
304(2)
Using Parallel Arrays
306(4)
Remaining within Array Bounds
310(2)
Improving Search Efficiency Using an Early Exit
312(2)
Searching an Array for a Range Match
314(4)
Chapter Summary
318(1)
Key Terms
318(1)
Review Questions
319(4)
Exercises
323
APPENDIX A Solving Difficult Structuring Problems A-1
APPENDIX B Understanding Numbering Systems and Computer Codes B-1
APPENDIX C Using a Large Decision Table C-1
GLOSSARY G-1
INDEX I-1


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