Problem Solving and Program Design in C

✍ Scribed by Hanly, Jeri R;Koffman, Elliot B

• Publisher: Pearson
• Year: 2015
• Tongue: English
• Leaves: 842
• Category: Library

✦ Synopsis

NOTE: You are purchasing a standalone product; MyProgrammingLab does not come packaged with this content If you would like to purchase MyProgrammingLab search for ISBN-10:0134243943 /ISBN-13: 9780134243948. That package includes ISBN-10: 0134014898 /ISBN-13: 9780134014890 and ISBN-10: 013425399X /ISBN-13: 9780134253992.
Learning to Program with ANSI-C
" Problem Solving and Program Design in C " teaches readers to program with ANSI-C, a standardized, industrial-strength programming language known for its power and probability. The text uses widely accepted software engineering methods to teach readers to design cohesive, adaptable, and reusable program solution modules with ANSI-C. Through case studies and real world examples, readers are able to envision a professional career in programming.
Widely perceived as an extremely difficult language due to its association with complex machinery, the Eighth Edition approaches C as conducive to introductory courses in program development. C language topics are organized based on the needs of beginner programmers rather than structure, making for an even easier introduction to the subject. Covering various aspects of software engineering, including a heavy focus on pointer concepts, the text engages readers to use their problem solving skills throughout.
Also Available with MyProgrammingLab
This title is also available with MyProgrammingLab an online homework, tutorial, and assessment program designed to work with this text to(engage students and improve results. Within its structured environment, students practice what they learn, test their understanding, and(pursue a personalized study plan that helps them better absorb course material and understand difficult concepts.
Students, if interested in purchasing this title with MyProgrammingLab, ask your instructor for the correct package ISBN and Course ID. Instructors, contact your Pearson representative for more information.
"

✦ Table of Contents

Cover......Page 1
Title Page......Page 4
Copyright Page......Page 5
Dedication......Page 6
Preface......Page 8
Contents......Page 14
Chapter 0: Computer Science as a Career Path......Page 22
Section 1: Why Computer Science May Be the Right Field for You......Page 23
Section 2: The College Experience: Computer Disciplines and Majors to Choose From......Page 25
Section 3: Career Opportunities......Page 30
Chapter 1: Overview of Computers and Programming......Page 34
1.1. Electronic Computers Then and Now......Page 35
1.2. Computer Hardware......Page 38
1.3. Computer Software......Page 46
1.4. The Software Development Method......Page 53
Case Study: Converting Miles to Kilometers......Page 57
1.6. Professional Ethics for Computer Programmers......Page 60
Chapter Review......Page 62
Chapter 2: Overview of C......Page 66
2.1. C Language Elements......Page 67
2.2. Variable Declarations and Data Types......Page 74
2.3. Executable Statements......Page 80
2.4. General Form of a C Program......Page 90
2.5. Arithmetic Expressions......Page 93
Case Study: Supermarket Coin Processor......Page 103
2.6. Formatting Numbers in Program Output......Page 108
2.7. Interactive Mode, Batch Mode, and Data Files......Page 111
2.8. Common Programming Errors......Page 114
Chapter Review......Page 120
Chapter 3: Top-Down Design with Functions......Page 128
3.1. Building Programs from Existing Information......Page 129
Case Study: Finding the Area and Circumference of a Circle......Page 130
Case Study: Computing the Weight of a Batch of Flat Washers......Page 133
3.2. Library Functions......Page 138
Case Study: Drawing Simple Diagrams......Page 145
3.4. Functions Without Arguments......Page 147
3.5. Functions with Input Arguments......Page 157
3.6. Introduction to Computer Graphics (Optional)......Page 167
3.7. Common Programming Errors......Page 184
Chapter Review......Page 185
Chapter 4: Selection Structures: if and switch Statements......Page 194
4.1. Control Structures......Page 195
4.2. Conditions......Page 196
4.3. The if Statement......Page 206
4.4. If Statements with Compound Statements......Page 212
4.5. Decision Steps in Algorithms......Page 215
Case Study: Water Bill Problem......Page 216
4.6. More Problem Solving......Page 225
Case Study: Water Bill with Conservation Requirements......Page 226
4.7. Nested if Statements and Multiple-Alternative Decisions......Page 228
4.8. The switch Statement......Page 238
C in Focus: The UNIX Connection......Page 242
4.9. Common Programming Errors......Page 244
Chapter Review......Page 245
Chapter 5: Repetition and Loop Statements......Page 256
5.1. Repetition in Programs......Page 257
5.2. Counting Loops and the while Statement......Page 259
5.3. Computing a Sum or a Product in a Loop......Page 263
5.4. The for Statement......Page 268
5.5. Conditional Loops......Page 277
5.6. Loop Design......Page 282
5.7. Nested Loops......Page 289
5.8. The do-while Statement and Flag-Controlled Loops......Page 294
5.9. Iterative Approximations......Page 297
Case Study: Bisection Method for Finding Roots......Page 299
5.10. How to Debug and Test Programs......Page 308
C in Focus: Team Programming......Page 310
5.11. Loops in Graphics Programs (Optional)......Page 312
5.12. Common Programming Errors......Page 319
Chapter Review......Page 322
Chapter 6: Pointers and Modular Programming......Page 338
6.1. Pointers and the Indirection Operator......Page 339
6.2. Functions with Output Parameters......Page 343
6.3. Multiple Calls to a Function with Input/Output Parameters......Page 351
6.4. Scope of Names......Page 357
6.5. Formal Output Parameters as Actual Arguments......Page 359
Case Study: Collecting Area for Solar-Heated House......Page 363
Case Study: Arithmetic with Common Fractions......Page 370
6.7. Debugging and Testing a Program System......Page 379
Chapter Review......Page 382
Chapter 7: Array Pointers......Page 398
7.1. Declaring and Referencing Arrays......Page 399
7.2. Array Subscripts......Page 402
7.3. Using for Loops for Sequential Access......Page 404
7.4. Using Array Elements as Function Arguments......Page 409
7.5. Array Arguments......Page 411
7.6. Searching and Sorting an Array......Page 424
7.7. Parallel Arrays and Enumerated Types......Page 429
7.8. Multidimensional Arrays......Page 437
Case Study: Summary of Hospital Revenue......Page 442
7.10. Graphics Programs with Arrays (Optional)......Page 451
7.11. Common Programming Errors......Page 460
Chapter Review......Page 461
Chapter 8: Strings......Page 476
8.1. String Basics......Page 477
8.2. String Library Functions: Assignment and Substrings......Page 483
8.3. Longer Strings: Concatenation and Whole-Line Input......Page 492
8.4. String Comparison......Page 497
C in Focus: Defensive Programming......Page 499
8.5. Arrays of Pointers......Page 501
8.6. Character Operations......Page 507
8.7. String-to-Number and Number-to-String Conversions......Page 512
Case Study: Text Editor......Page 519
8.9. Common Programming Errors......Page 528
Chapter Review......Page 530
Chapter 9: Recursion......Page 542
9.1. The Nature of Recursion......Page 543
9.2. Tracing a Recursive Function......Page 549
9.3. Recursive Mathematical Functions......Page 557
Case Study: Finding Capital Letters in a String......Page 563
Case Study: Recursive Selection Sort......Page 566
Case Study: Operations on Sets......Page 570
9.6. A Classic Case Study in Recursion: Towers of Hanoi......Page 578
9.7. Common Programming Errors......Page 583
Chapter Review......Page 585
Chapter 10: Structure and Union Types......Page 592
10.1. User-Defined Structure Types......Page 593
10.2. Structure Type Data as Input and Output Parameters......Page 599
10.3. Functions Whose Result Values Are Structured......Page 605
C in Focus: Evolving Standards......Page 607
Case Study: A User-Defined Type for Complex Numbers......Page 609
10.5. Parallel Arrays and Arrays of Structures......Page 617
Case Study: Universal Measurement Conversion......Page 619
10.6. Union Types (Optional)......Page 628
Chapter Review......Page 635
Chapter 11: Text and Binary File Pointers......Page 650
11.1. Input/Output Files: Review and Further Study......Page 651
11.2. Binary Files......Page 661
11.3. Searching a Database......Page 667
Case Study: Database Inquiry......Page 668
11.4. Common Programming Errors......Page 677
Chapter Review......Page 678
Chapter 12: Programming in the Large......Page 686
12.1. Using Abstraction to Manage Complexity......Page 687
12.2. Personal Libraries: Header Files......Page 690
12.3. Personal Libraries: Implementation Files......Page 695
12.4. Storage Classes......Page 698
12.5. Modifying Functions for Inclusion in a Library......Page 702
12.6. Conditional Compilation......Page 705
12.7. Arguments to Function main......Page 709
12.8. Defining Macros with Parameters......Page 712
12.9. Common Programming Errors......Page 717
Chapter Review......Page 718
Chapter 13: Pointers and Dynamic Data Structures......Page 726
13.1. Pointers......Page 727
13.2. Dynamic Memory Allocation......Page 732
13.3. Linked Lists......Page 737
13.4. Linked List Operators......Page 743
13.5. Representing a Stack with a Linked List......Page 748
13.6. Representing a Queue with a Linked List......Page 752
13.7. Ordered Lists......Page 758
Case Study: Maintaining an Ordered List of Integers......Page 759
13.8. Binary Trees......Page 770
13.9. Common Programming Errors......Page 780
Chapter Review......Page 781
Appendix A: More About Pointers......Page 790
Appendix B: ANSI C Standard Libraries......Page 796
Appendix C: C Operators......Page 814
Appendix D: Character Sets......Page 820
Appendix E: ANSI C Reserved Words......Page 822
Glossary......Page 824
Index......Page 830
Back Cover......Page 842

✦ Subjects

Computer Science;Programming;Nonfiction;Computers;Science;Textbooks;Reference;Academic;School