Beginning with C

목차 (Table of Contents)

• CONTENTS
• Preface = ⅴ
• Acknowledgments = ⅷ
• 1 Background and overview = 1
• 1.1 The basic operations of a computer = 2
• 1.2 Controlling the computer :programs = 3
• 1.2.1 Why write programs? = 4
• 1.2.2 Machine language programs = 4
• 1.2.3 Programming languages = 5
• 1.2.4 Using a compiler = 7
• 1.3 Algorithms = 7
• 1.4 The program development process = 8
• 1.5 Documentation = 9
• 1.6 Summary = 10
• 1.7 Self-test exercises = 11
• 1.8 Test questions = 12
• 2 Developing programs : calling functions = 15
• 2.1 Overview : why we structure computer programs = 16
• 2.2 C functions and programs = 18
• 2.2.1 The function main = 19
• 2.2.2 Calling functions = 19
• 2.2.3 The standard C function library = 21
• 2.2.4 Writing void functions = 22
• 2.2.5 Frequently-asked questions about functions = 24
• 2.2.6 Structuring the program with functions = 26
• 2.3 Comments = 27
• 2.3.1 Documenting functions ; preconditions and postconditions = 28
• 2.4 Function declarations = 29
• 2.5 Example : Printing name tags = 29
• 2.6 Some formalities (syntax) = 33
• 2.7 Summary = 34
• 2.8 Self-test exercises = 35
• 2.9 Test questions = 36
• 3 Data = 39
• 3.1 Data types = 40
• 3.2 Constants, variables and expressions = 41
• 3.2.1 String literals = 43
• 3.2.2 Constants : integers and characters = 45
• 3.3 Char and int variables ; char arrays = 47
• 3.4 printf facilities for data output = 49
• 3.5 Example : Name tags with seat numbers = 51
• 3.6 Expressions = 55
• 3.6.1 Operators = 55
• 3.6.2 Function results = 57
• 3.7 Other data types = 57
• 3.7.1 Floating point data : float and double = 57
• 3.7.2 The type long = 60
• 3.8 Summary = 61
• 3.9 Self-test exercises = 62
• 3.10 Test questions = 64
• 4 Repetition = 67
• 4.1 Introduction = 68
• 4.2 Types of loops = 68
• 4.3 Writing loops in C = 69
• 4.3.1 The while loop = 69
• 4.3.2 The for loop = 72
• 4.3.3 The do...while loop = 73
• 4.4 More C operators = 75
• 4.4.1 Comparison operators = 75
• 4.4.2 Operator precedence = 75
• 4.5 Example : Computing products and sums = 76
• 4.6 Creating quality programs : giving names to constants (#define) ; the preprocessor = 79
• 4.7 Program verification : correctness of a loop (optional) = 82
• 4.8 Short examples = 86
• 4.9 Summary = 88
• 4.10 Self-test exercises = 89
• 4.11 Test questions = 91
• 5 Input : obtaining data from outside the program = 97
• 5.1 Introduction - how input happens = 98
• 5.2 Input in C programs = 99
• 5.2.1 Using the scanf library function to read ints = 99
• 5.2.2 Reading other numeric data types = 101
• 5.2.3 Reading chars, whitespace = 101
• 5.2.4 Some important warnings = 103
• 5.3 Inputting and outputting strings = 104
• 5.3.1 Inputting words with scanf = 104
• 5.3.2 Inputting lines with gets = 106
• 5.4 Programming examples and some useful techniques = 107
• 5.4.1 Example : Rearranging names = 107
• 5.4.2 Example : Processing until a certain event happens = 109
• 5.4.3 Short example : Skipping incorrect input = 112
• 5.4.4 The scanf function return = 113
• 5.4.5 Example : Report of purchases ad sales = 115
• 5.5 Input and output redirection = 119
• 5.6 Summary = 120
• 5.7 Self-test exercises = 121
• 5.8 Test questions = 123
• 6 Making choices : the conditional statements if and switch = 129
• 6.1 Conditional statements = 130
• 6.2 if : C's main selection statement = 131
• 6.2.1 Simple if statements = 131
• 6.2.2 A remark about program layout rules = 133
• 6.2.3 Multiple-test conditionals = 134
• 6.3 Logical expressions = 136
• 6.3.1 More logical operators = 137
• 6.3.2 Reasoning about logical expressions = 138
• 6.4 The switch statement = 140
• 6.4.1 Example : Telephone charges = 141
• 6.5 The string comparison functions = 146
• 6.6 Structured programming = 148
• 6.7 Summary = 148
• 6.8 Self-test exercises = 149
• 6.9 Test questions = 150
• 7 Writing functions with arguments and results = 155
• 7.1 Introduction = 156
• 7.2 Writing functions with simple arguments = 156
• 7.3 Writing functions with array arguments = 162
• 7.4 Example = 165
• 7.5 Writing functions that return results = 167
• 7.5.1 A larger example of a function returning a result = 169
• 7.6 Using return = 171
• 7.6.1 Using return inside main : program exit status = 172
• 7.7 Old-style function definitions and declarations = 172
• 7.8 Function libraries = 173
• 7.9 A brief stock-take = 174
• 7.10 Summary = 174
• 7.11 Self-test exercises = 176
• 7.12 Test questions = 178
• 8 Top-down programming :choosing the program structure = 183
• 8.1 Top-down programming = 184
• 8.2 Designing a good program structure = 185
• 8.3 Example : A simple calculator = 186
• 8.4 Example : Printing a month in a calendar = 193
• 8.5 Object-oriented programming = 203
• 8.6 Program debugging = 203
• 8.7 Summary = 206
• 8.8 Self-test exercises = 206
• 8.9 Test questions = 207
• 9 Arrays = 211
• 9.1 Introduction = 212
• 9.2 Storing numeric data = 213
• 9.3 Using array elements to represent categories = 217
• 9.4 Searching and sorting = 220
• 9.5 Multi-dimensional arrays ; initialization = 224
• 9.5.1 Initialization during declaration = 226
• 9.5.2 Example : matrix multiplication = 228
• 9.6 Summary = 231
• 9.7 Self-test exercises = 232
• 9.8 Test questions = 233
• 10 Text files = 239
• 10.1 Storing data in files ; text and binary file types = 240
• 10.2 Overview of file processing in C = 240
• 10.3 File output = 241
• 10.4 File input = 245
• 10.4.1 End of file (EOF) = 250
• 10.5 Predefined FILE pointer names = 257
• 10.6 Example : File merge = 258
• 10.7 Data conversion functions (optional) = 265
• 10.8 A warning = 266
• 10.9 Summary = 267
• 10.10 Self-test exercises = 268
• 10.11 Test questions = 269
• 11 Structuring data = 273
• 11.1 Introduction = 274
• 11.2 Creating new data types (typedef) = 274
• 11.3 Creating structures (struct) = 276
• 11.4 Example : Sorting employee records = 280
• 11.5 Example : Vectors = 285
• 11.6 Summary = 294
• 11.7 Self-test exercises = 295
• 11.8 Test questions = 295
• 12 Memory addresses : pointers = 299
• 12.1 Introduction to pointers = 300
• 12.2 Important example : Modifying function arguments = 302
• 12.3 Pointers, arrays, and pointer arithmetic = 305
• 12.3.1 Pointer arithmetic = 306
• 12.3.2 Library string and memory functions = 308
• 12.4 Pointers and structures = 312
• 12.5 Summary = 317
• 12.6 Self-test exercises = 318
• 12.7 Test questions = 319
• 13 Advanced programming with pointers = 323
• 13.1 Dynamic memory allocation = 324
• 13.2 Creating linked data structures = 331
• 13.3 Processing command - line arguments = 341
• 13.4 Pointers to functions = 343
• 13.5 'Complicated' C declarations = 346
• 13.6 Summary = 348
• 13.7 Self-test exercises = 349
• 13.8 Test questions = 350
• 14 Recursion = 355
• 14.1 Introduction = 356
• 14.2 Example : Parsing arithmetic expressions = 356
• 14.3 Designing recursive algorithms : what works and what doesn't = 359
• 14.3.1 Some general principles for writing correct recursive functions = 364
• 14.3.2 Some pitfalls = 368
• 14.4 Example : Matchstick puzzle = 371
• 14.5 Summary = 378
• 14.6 Self-test exercises = 379
• 14.7 Test questions = 379
• 15 Data structures and abstract data types = 383
• 15.1 Introduction = 384
• 15.2 Example : The stack as an abstract data type = 385
• 15.2.1 Array - based stack implementation = 389
• 15.2.2 Stack implementation using a linked list = 391
• 15.3 Key issues concerning abstract data types = 393
• 15.4 Summary = 395
• 15.5 Self-test exercises = 395
• 15.6 Test questions = 396
• 16 Further issues concerning numeric computation = 397
• 16.1 Introduction = 398
• 16.2 Integral data types = 398
• 16.2.1 Choosing the right integral type = 400
• 16.2.2 Integral constants = 401
• 16.3 Floating-point data types = 402
• 16.3.1 Floating-point constants = 404
• 16.4 Additional printf and scanf formatting features = 404
• 16.4.1 printf, fprintf, and sprintf = 404
• 16.4.2 scanf, fscanf, and sscanf formats = 405
• 16.5 Mixing types in expressions = 406
• 16.6 Overflow, underflow, and accuracy = 408
• 16.7 Representing money = 411
• 16.8 Summary = 412
• 16.9 Self-test exercises = 412
• 16.10 Test questions = 413
• 17 Random-access and binary input-output = 415
• 17.1 Introduction = 416
• 17.2 Binary input-output and binary files = 416
• 17.3 Random-access to files = 422
• 17.4 Additional file manipulation functions = 436
• 17.4.1 ftell and fseek = 436
• 17.4.2 fflush = 437
• 17.4.3 setvbuf = 438
• 17.5 Summary = 439
• 17.6 Self-test exercises = 439
• 17.7 Test questions = 440
• 18 Scoping and linkage rules, storage duration, source file management, const parameters = 443
• 18.1 Introduction = 444
• 18.2 Scope = 444
• 18.3 Linkage = 447
• 18.4 Storage duration = 449
• 18.5 Additional preprocessor features = 450
• 18.5.1 Conditional compilation = 450
• 18.5.2 Writing reliable header (.h) files = 454
• 18.5.3 (Optional) Parameterized macros = 455
• 18.6 The const attribute = 460
• 18.7 Summary = 461
• 18.8 Self-test exercises = 462
• 18.9 Test questions = 463
• 19 Efficiency, searching and sorting = 465
• 19.1 Introduction = 466
• 19.2 Algorithm efficiency = 466
• 19.3 Searching = 466
• 19.3.1 Example : Binary search = 468
• 19.3.2 Using the bsearch standard library function = 470
• 19.3.3 Writing your own version of bsearch (optional) = 473
• 19.4 Sorting = 475
• 19.4.1 Example : Quick sort = 476
• 19.4.2 Using the library qsort function = 478
• 19.5 Conclusion = 480
• 19.6 Summary = 480
• 19.7 Self-test exercises = 481
• 19.8 Test questions = 481
• Appendix A : Answers to self-test exercises = 483
• Appendix B : Sample sessions = 491
• B.1 Compiling C programs under Unix = 491
• B.2 Compiling C programs under DOS = 493
• Appendix C : Additional C language features = 497
• C.1 Additional statement types = 497
• C.1.1 goto statements and labels = 497
• C.1.2 break statements in loops = 497
• C.1.3 continue statements = 498
• C.1.4 Empty statements = 498
• C.2 Additional features in declarations = 499
• C.2.1 The auto and register storage class specifiers = 499
• C.2.2 Unions = 500
• C.2.3 Bit-fields = 500
• C.2.4 Enumeration (enum) specifiers = 500
• C.2.5 The volatile type qualifier = 501
• C.2.6 Functions with a variable number of parameters = 501
• C.3 Additional operators = 503
• C.3.1 Bitwise operators (∼, ＞＞, ＜＜, &, ｜, and ＾) = 503
• C.3.2 The conditional (？ :) operator = 503
• C.3.3 Priority of all operators, and sequence points = 504
• C.4 Miscellaneous features = 505
• C.4.1 Multibyte characters = 505
• C.4.2 Trigraph sequences = 506
• C.4.3 Further preprocessor features = 506
• C.5 Rvalues, lvalues, arrays and pointers = 507
• Appendix D : Descriptions of frequently - used standard library functions and macros = 509
• D.1 Common definitions (include ＜stddef.h＞) = 509
• D.2 Character handling (include ＜ctype.h＞) = 509
• D.3 Mathematics (include ＜math.h＞) = 510
• D.4 Nonlocal jumps (include ＜setjmp.h＞) = 512
• D.5 Variable arguments (include ＜stdarg.h＞) = 512
• D.6 Input／output (include ＜stdio.h＞) = 512
• D.7 String conversion functions (include ＜stdlib.h＞) = 516
• D.8 Random number functions (include ＜stlib.h＞) = 517
• D.9 Memory allocation functions (include ＜stlib.h＞) = 517
• D.10 Communication with the environment (include ＜stlib.h＞) = 517
• D.11 Searching and sorting utilities (include ＜stlib.h＞) = 518
• D.12 Integer arithmetic functions (include ＜stlib.h＞) = 518
• D.13 String handling (include ＜string.h＞) = 519
• D.14 Date and time (include ＜time.h＞) = 520
• D.15 Diagnostics (include ＜assert.h＞) = 523
• Appendix E : Program layout rules used in example programs = 525
• Appendix F : C syntax summary = 529
• F.1 Lexical grammar ('building blocks' of the language) = 529
• F.1.1 Keywords = 529
• F.1.2 Identifiers = 530
• F.1.3 Constants = 530
• F.1.4 String literals = 531
• F.1.5 Operators = 531
• F.1.6 Punctuators = 531
• F.1.7 Header names = 532
• F.2 Phrase structure grammar = 532
• F.2.1 Expressions = 532
• F.2.2 Declarations = 533
• F.2.3 Statements = 535
• F.2.4 External definitions = 535
• F.3 Preprocessing directives = 536
• Appendix G :ASCII codes = 539
• Glossary = 541
• Bibliography = 553
• Index by topic and language feature = 555
• Alphabetic index = 561