Problem solving and computation for scientists and engineers : an introduction using C

목차 (Table of Contents)

• CONTENTS
• PREFACE = xv
• 1 PROBLEMS, ALGORITHMS AND COMPUTER PROGRAMS = 1
• 1.1 Introduction = 1
• 1.2 Examples of Algorithms = 2
• 1.3 Solving Problems with Computers = 4
• 1.4 What is a Computer? = 6
• 1.4.1 The Central Processing Unit = 7
• 1.4.2 Random Access Memory = 7
• 1.4.3 The Bus = 8
• 1.4.4 Secondary Storage = 9
• 1.4.5 Displays or Terminals = 9
• 1.5 A Hypothetical Robot = 9
• 1.6 System Software = 13
• 1.7 Where To From Here? = 14
• 1.8 Exercises = 14
• 2 THE C LANGUAGE AND SOME ELEMENTARY ALGORITHMS = 17
• 2.1 Introduction = 17
• 2.2 History of C = 18
• 2.3 Constituents of a C Program = 19
• 2.4 Simple C Variables and Assignment Statements = 20
• 2.5 Arithmetic Operations = 22
• 2.6 Definition of Variables = 24
• 2.6 1 Integers and Characters = 24
• 2.6.2 Floating-point Types = 26
• 2.7 Constants = 26
• 2.8 Integer and Mixed Arithmetic = 27
• 2.8.1 Integer Division = 27
• 2.8.2 Conversion of Types in Assignment Statements = 28
• 2.8.3 Conversion of Types in Mixed Expressions = 28
• 2.8.4 Forcing Type Conversions Using Casts = 30
• 2.9 Invoking Functions in C = 31
• 2.10 Header Files and the C Preprocessor = 34
• 2.11 Programming Project: A First Complete C Program = 35
• 2.12 Function Prototypes = 35
• 2.13 Passing Arguments to Functions: Call by Value = 37
• 2.14 Output with printf () = 40
• 2.15 Input with scanf (> = 43
• 2.16 Writing New Functions: Scope of Variables = 45
• 2.17 Blocks and if... else if Statements = 48
• 2.18 Loops = 52
• 2.19 Increment and Decrement Operators = 55
• 2.20 Programming Project: Is an Integer Prime? = 56
• 2.21 Programming Project: Greatest Common Divisors = 59
• 2.21.1 Recursive Implementation of Euclid's Algorithm = 61
• 2.22 Summary of Chapter 2 = 63
• 2.23 Exercises = 65
• 3 NUMERICAL ANALYSIS = 73
• 3.1 Introduction = 73
• 3.2 Floating-Point Representation = 75
• 3.2.1 Typical Implementation = 75
• 3.2.2 Overflow and Underflow = 77
• 3.2.3 Limitations on Precision = 77
• 3.2.4 Header file float.h = 79
• 3.3 The Standard C Mathematical Function Library = 80
• 3.4 Pointers to Functions = 83
• 3.5 Root Finding = 86
• 3.5.1 Finding an Interval Containing a Root = 88
• 3.5.2 Bisection Method = 90
• 3.5.3 Secant Method = 91
• 3.5.4 Newton's Method = 93
• 3.5.5 Problems in Applying Root Finding Methods = 96
• 3.6 Programming Project: Acceleration of a Train = 99
• 3.7 Numerical Integration = 102
• 3.7.1 Rectangular Rule = 102
• 3.7.2 Trapezoidal Rule = 102
• 3.7.3 Simpson's Rule = 105
• 3.7.4 Adaptive Integration = 106
• 3.7.5 Other Methods = 107
• 3.8 Programming Project: The Fresnel Sine Integral = 108
• 3.9 Ordinary Differential Equations = 111
• 3.9.1 Euler's Method = 112
• 3.9.2 Sources of Error in Euler's Method = 114
• 3.9.3 Runge-Kutta Methods = 115
• 3.10 Programming Project: Motion of a Pendulum = 118
• 3.11 Summary of Chapter 3 = 121
• 3.12 Exercises = 122
• 4 LINEAR ALGEBRA = 129
• 4.1 Introduction = 129
• 4.2 Representing Vectors in C = 130
• 4.2.1 What Are Arrays? = 130
• 4.2.2 Arrays, Pointers and Address Arithmetic = 131
• 4.2.3 Arrays as Arguments to Functions = 135
• 4.2.4 Initialization of Arrays = 137
• 4.2.5 Subscript Checking in C = 137
• 4.3 Representing Strings in C = 138
• 4.4 Vector Operations = 141
• 4.5 Programming Project: Population Forecasting = 144
• 4.6 Representing Matrices in C = 150
• 4.6.1 Multidimensional Arrays = 150
• 4.6.2 Multidimensional Arrays as Arguments to Functions = 152
• 4.6.3 Initialization of Multidimensional Arrays = 155
• 4.6.4 Using Macros with Arguments to Reference Array Elements = 155
• 4.7 Basic Matrix Operations = 158
• 4.8 Simultaneous Equations = 162
• 4.8.1 Simple Gauss-Jordan Elimination = 162
• 4.8.2 Partial Pivoting = 166
• 4.8.3 Solving Systems of Linear Equations with the Same Coefficients = 169
• 4.8.4 Improvements in Gauss-Jordan = 170
• 4.9 Matrix Inversion = 172
• 4.10 Programming Project: Shortest Paths in a Network = 174
• 4.10.1 The Floyd-Warshall Algorithm = 176
• 4.10.2 Implementation of the Floyd-Warshall Algorithm = 178
• 4.11 Programming Project: Simulating a Robot in a Maze = 181
• 4.12 Summary of Chapter 4 = 192
• 4.13 Exercises = 194
• 5 DATA STRUCTURES = 203
• 5.1 Introduction = 203
• 5.2 The Basics of C Structures = 205
• 5.2.1 Creating a Structure in C = 205
• 5.2.2 Accessing Members of a Structure = 207
• 5.2.3 Initialization of a struct = 208
• 5.2.4 Structure Pointers and the Member Access Operator = 209
• 5.2.5 Allowable Operations on Structures = 211
• 5.2.6 Using Structures as Function Arguments and Returned Values = 212
• 5.3 Programming Project: A Stack = 214
• 5.3.1 An Aside on Modularity in Software Design = 219
• 5.4 Dynamic Memory Allocation and Void Pointers = 221
• 5.4.1 Void Pointers and malloc () = 227
• 5.4.2 The sizeof Operator = 223
• 5.4.3 calloc (), realloc () and free () = 224
• 5.5 Ragged Arrays in C = 226
• 5.6 Arguments to main() = 228
• 5.7 The typedef Statement = 229
• 5.8 C Programs with Multiple Source Files = 230
• 5.9 Programming Project: Stacks Revisited = 232
• 5.10 Linear Linked Lists = 238
• 5.10.1 Self-Referential Data Structures = 239
• 5.10.2 Implementation of Operations on Lists = 240
• 5.11 Queues = 245
• 5.11.1 Implementing a Queue = 245
• 5.11.2 Using Queues = 249
• 5.12 Trees = 251
• 5.12.1 Terminology for Trees = 252
• 5.12.2 Implementing a Binary Tree = 253
• 5.13 Programming Project: The Tile Puzzle Problem = 255
• 5.13.1 Organizing the Solution as a Tree = 257
• 5.13.2 Implementing the Puzzle Algorithm = 260
• 5.14 Polymorphism in Data Structures = 266
• 5.15 Summary of Chapter 5 = 270
• 5.16 Exercises = 271
• 6 SORTING AND SEARCHING = 280
• 6.1 Introduction = 280
• 6.2 Files in C = 281
• 6.2.1 Opening a File = 282
• 6.2.2 Reading from a File = 284
• 6.2.3 Writing to a File = 284
• 6.2.4 Chsing a File = 285
• 6.2.5 An Example Using Files = 285
• 6.3 Sorting = 286
• 6.3.1 Insertion Sort = 288
• 6.3.2 General Insertion Sort = 291
• 6.3.3 Shellsort = 293
• 6.3.4 Selection Sort = 295
• 6.3.5 Quicksort = 295
• 6.4 Simple Searching Methods = 300
• 6.4.1 Linear Search = 302
• 6.4.2 Binary Search = 304
• 6.5 Binary Search Trees = 305
• 6.5.1 Searching in a Binary Search Tree = 308
• 6.5.2 Adding a Node to a Binary Search Tree = 309
• 6.5.3 Construction of a Binary Search Tree = 310
• 6.5.4 Node Deletion = 312
• 6.6 Hashing = 317
• 6.6.1 Hash Functions = 318
• 6.6.2 Linear Probing = 320
• 6.6.3 Double Hashing = 323
• 6.6.4 Chaining = 324
• 6.6.5 Deleting a Record = 327
• 6.7 Programming Project: The Tile Puzzle Revisited = 328
• 6.8 Summary of Chapter 6 = 331
• 6.9 Exercises = 333
• 7 GRAPHICS = 339
• 7.1 Introduction = 339
• 7.2 Graphics Devices and Terminology = 340
• 7.2.1 Graphics Displays = 340
• 7.2.2 Color Displays and Color Maps = 342
• 7.2.3 Graphics Input Devices = 344
• 7.2.4 Graphics Hard Copy Devices = 344
• 7.3 Graphics Algorithms in Device Coordinates = 345
• 7.3.1 Bresenham's Algorithm for Vector Drawing: Restricted Case = 346
• 7.3.2 Bresenham's Algorithm for General Line Segments = 349
• 7.3.3 Bresenham's Algorithm for Circles = 351
• 7.4 Coordinate Transformations in Two Dimensions = 354
• 7.4.1 Coordinate Systems = 354
• 7.4.2 Translation = 355
• 7.4.3 Scaling = 356
• 7.4.4 Rotation Around the Origin = 356
• 7.4.5 General Transformations = 358
• 7.5 Homogeneous Coordinates in Two Dimensions = 361
• 7.6 Coordinate Transformations in Three Dimensions = 363
• 7.7 Parametric and Nonparametric Curves = 370
• 7.7.1 Drawing Curves = 371
• 7.8 Elementary Geometric Algorithms = 374
• 7.8.1 Is a Point Above or Below a Line? = 375
• 7.8.2 Do Two Line Segments Intersect? = 376
• 7.8.3 Is a Point in a Polygon? = 379
• 7.8.4 Convex Hulls = 383
• 7.8.5 Improving the Package-Wrapping Algorithm = 389
• 7.9 Summary of Chapter 7 = 390
• 7.10 Exercises = 391
• 8 PROBABILISTIC SIMULATION = 396
• 8.1 Introduction = 396
• 8.2 Random Variables and Processes = 397
• 8.3 Random Number Generation Functions in Standard C = 400
• 8.4 Programming Project: Monte Carlo Integration = 401
• 8.5 Programming Project: A Simple Queueing System = 403
• 8.6 Random Number Generators = 409
• 8.6.1 Linear Congruential Method = 409
• 8.6.2 Implementation of randO in the C Library = 410
• 8.6.3 Setting the Seed in the C Library = 412
• 8.6.4 Additive Congruential Method = 413
• 8.7 Creating Nonuniform Random Numbers = 414
• 8.7.1 Inverse Cumulative Method = 415
• 8.7.2 Construction Method = 419
• 8.7.3 Rejection Method = 422
• 8.8 Using Heaps in Simulations = 424
• 8.9 Programming Project: Simulating a Modem Pool = 432
• 8.9.1 Description of a Modem Pool = 432
• 8.9.2 Major Variables Used in Simulation = 433
• 8.9.3 Functions Used in Simulation = 434
• 8.9.4 Implementation of Simulation = 435
• 8.9.5 Using the Modem Pool Simulation = 438
• 8.10 Major Issues in Large Simulations = 440
• 8.11 Summary of Chapter 8 = 441
• 8.12 Exercises = 443
• 9 OBJECT-ORIENTED PROGRAMMING AND C+ + = 448
• 9.1 Introduction = 448
• 9.2 Key Ideas in Object-Oriented Programming = 449
• 9.3 A Simple Class in C++ = 453
• 9.3.1 Declaration of the Class point 2D = 453
• 9.3.2 The Implementation of the ClassPoiat2D = 456
• 9.3.3 Using the Simple Class Library = 459
• 9.4 Building a More Complicated Class = 460
• 9.4.1 Declaration of the Polygon Class = 460
• 9.4.2 Implementation of the Polygon Class = 463
• 9.4.3 Using Polygon Class = 468
• 9.5 Inheritance: Creating a Derived Class = 469
• 9.5.1 Implementation of the Derived Class Rectangle = 470
• 9.5.2 Using the'Rectangle Derived Class = 473
• 9.6 Other Features in C++ = 473
• 9.6.1 Function Prototypes Are Required in C++ = 474
• 9.6.2 inline Functions = 474
• 9.6.3 The iostreams Class Library = 475
• 9.6.4 Protected Class Members = 476
• 9.6.5 Multiple Inheritance = 477
• 9.6.6 Dynamic Binding and Virtual Functions = 478
• 9.7 Summary of Chapter 9 = 479
• 9.8 Exercises = 480
• APPENDIX: OTHER PARTS OF THE C LANGUAGE = 483
• A.1 Other Representations for Constants = 483
• A.2 Mixed Arithmetic with Unsigned Quantities = 484
• A.3 Storing Variables in Registers = 484
• A.4 The const and volatile Qualifiers = 485
• A.5 Other parts of Control Strings In priritf () and scanf () = 486
• A.6 Character Input and Output = 486
• A.6.1 Character Input = 486
• A.6.2 Character Output = 486
• A.7 String Input and Output Functions = 487
• A.8 The Math Library = 488
• A.9 The Character Library = 490
• A.10 Sorting and Searching Functions in the C Library = 491
• A.11 Other Parts of the Standard C Library = 492
• A.12 Special Types size_t and ptrdiff_t = 492
• A.13 Enumerations = 493
• A.14 Other Preprocessor Features = 495
• A.15 The do...while Statement = 498
• A.16 The switch and break Statements = 499
• A.17 The continue Statement = 500
• A.18 Statement Labels and goto = 501
• A.19 Unions = 501
• A.20 The Conditional Operator = 503
• A.21 Bit Operators = 503
• A.22 Bit Fields = 505
• A.23 Backward Compatibility with Earlier Versions of C = 505
• REFERENCES = 508
• INDEX = 511