Problem solving and program design in C
著者
書誌事項
Problem solving and program design in C
Addison-Wesley, 1996
2nd ed
大学図書館所蔵 件 / 全5件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes index
内容説明・目次
内容説明
Using a subset of ANSI C, Problem Solving and Program Design in C, Second Edition teaches a disciplined approach to solving problems and to applying widely accepted software engineering methods to design program solutions. Intended for a first course in programming, this text assumes no prior knowledge of computers or programming. Written to be accessible to students, concepts are presented in an order that makes sense to the beginning programmer --not in units dictated by the structure of the language. A broad selection of case studies and exercises allow an instructor to design an introductory programming course in C for computer science majors or for students from a wide range of other disciplines. While retaining its proven problem solving approach, the new edition has been refined to become an even stronger teaching tool.Features: * Introduces the difficult concept of pointers, uniquely and effectively, over four separate chapters * Covers user-defined functions with input parameters in Chapter 3, allowing students to do more meaningful programs early * Provides complete coverage of loop constructs (Chapter 5) and complete coverage of stacks (Chapter 8 Arrays, Chapter 10 Recursion, Chapter 14 Dynamic Memory Allocation) * Includes a complete appendix of ANSI C Standard Library Functions for reference * Reinforces key concepts using strong pedagogical features including program style boxes, syntax displays, end-of-section exercises, case studies, common error sections, programming projects, and others 0201590638B04062001
目次
(All chapters conclude with a Chapter Review.) 1. Overview of Computers and Programming. Electronic Computers Then and Now. Introduction to Computer Hardware. Overview of Programming Languages. Processing a High-Level Language Program. The Software Development Method. Applying the Software Development Method. Case Study: Converting Miles to Kilometers. 2. Overview of C. C Language Elements. Variable Declarations and Data Types. Executable Statements. General Form of a C Program. Arithmetic Expressions. Case Study: Evaluating a Collection of Coins. Formatting Numbers in Program Output. Interactive Mode, Batch Mode, and Data Files. Common Programming Errors. 3. Top-Down Design with Functions. Building Programs from Existing Information. Case Study: Finding the Area and Circumference of a Circle. Case Study: Computing the Weight of a Batch of Flat Washers. Library Functions. Top-Down Design and Structure Charts. Case Study: Drawing Simple Diagrams. Functions without Arguments. Functions with Input Arguments. Common Programming Errors. 4. Selection Structures: if and switch Statements. Control Structures. Conditions. The if Statement. If Statements with Compound Statements. Decision Steps in Algorithms. Case Study: Water Bill Problem. More Problem Solving. Case Study: Water Bill with Conservation Requirements. Nested if Statements and Multiple-Alternative Decisions. The switch Statement. Common Programming Errors. 5. Repetition and Loop Statements. Repetition in Programs and the while Statement. Computing a Sum or Product in a Loop. Counting Loops and the for Statement. Conditional Loops. Loop Design. Nested Loops. The do-while Statement and Flag-Controlled Loops. Problem Solving Illustrated. Case Study: Computing Radiation Levels. How to Debug and Test Programs. Common Programming Errors. 6. Modular Programming. Functions with Simple Output Parameters. Multiple Calls to a Function with Input/Output Parameters. Scope of Names. Formal Output Parameters as Actual Arguments. A Program with Multiple Functions. Case Study: Arithmetic with Common Fractions. Debugging and Testing a Program System. Common Programming Errors. 7. Simple Data Types. Representation and Conversion of Numeric Types. Representation and Conversion of type char. Enumerated Types. Iterative Approximations. Case Study: Bisection Method for Finding Roots. Common Programming Errors. 8. Arrays. Declaring and Referencing Arrays. Array Subscripts. Using for Loops for Sequential Access. Using Array Elements as Function Arguments. Array Arguments. Searching and Sorting an Array. Multidimensional Arrays. Array Processing Illustrated. Case Study: Analysis of Sales Data. Common Programming Errors. 9. Strings. String Basics. String Library Functions: Assignment and Substrings. Longer Strings: Concatenation and Whole-Line Input. String Comparison. Arrays of Pointers. Character Operations. String-to-Number and Number-to-String Conversions. String Processing Illustrated. Case Study: Text Editor. Common Programming Errors. 10. Recursion. The Nature of Recursion. Tracing a Recursive Function. Recursive Mathematical Functions. Recursive Functions with Array and String Parameters. Case Study: Finding Capital Letters in a String. Case Study: Recursive Selection Sort. Problem Solving with Recursion. Case Study: Operations on Sets. A Classic Case Study in Recursion: Towers of Hanoi. Common Programming Errors. 11. Structure and Union Types. User-Defined Structure Types. Structure Type Data as Input and Output Parameters. Functions Whose Result Values Are Structured. Problem Solving with Structure Types. Case Study: A User-Defined Type for Complex Numbers. Parallel Arrays and Arrays of Structures. Case Study: Universal Measurement Conversion. Union Types (Optional). Common Programming Errors. 12. Text and Binary File Processing. Input/Output Files: Review and Further Study. Binary Files. Searching a Database. Case Study: Database Inquiry. Common Programming Errors. 13. Programming in the Large. Using Abstraction to Manage Complexity. Personal Libraries: Header Files. Personal Libraries: Implementation Files. Storage Classes. Modifying Functions for Inclusion in a Library. Conditional Compilation. Arguments to Function main. Defining Macros with Parameters. Common Programming Errors. 14. Dynamic Data Structures. Pointers and the Functions malloc and calloc. Linked Lists. Linked List Operators. Representing a Stack with a Linked List. Representing a Queue with a Linked List. Ordered Lists. Case Study: Maintaining an Ordered List of Integers. Binary Trees. Common Programming Errors. Appendixes. A: Character Sets. B: ANSI C Standard Libraries. C: C Operators. D: Pointer Arithmetic. E: ANSI C Reserved Words. Answers. Index. 0201590638T04062001
「Nielsen BookData」 より