ISBN: Ostalo
Godina izdanja: 1970
Jezik: Engleski
Oblast: Matematika
Autor: Strani

U dobrom stanju

Mathematics for Data Processing Hardcover
Salvatore De Angelo , Paul Jorgensen
Publisher ‏ : ‎ McGraw-Hill Inc.,US (1 July 1970)
Language ‏ : ‎ English
Hardcover ‏ : ‎ 336 pages


CONTENTS
preface v
PART I
Chapter 1: Introduction 3
1.1 Calculating Machines 3
1.2 Information Handling 4
1.3 Computational Problems 4
Problem Origination 6
1.5 Solving Process,!
1.6 The Computer Program 9
1.7 The Electronic Computer 10
1.8 The Stored Program, ;10
1.9 Conclusions 11
Chapter 2: Review of Basic Algebra 13
2.1 Axioms and Operations 14
21.2 4 Inequalities
2.3 Exponents. 25
2.4 Positional Numbering Systems
2.5 Scientific and Floating Point Notation 33
2.6 Non-integral Exponents 39
2.7 Logarithms 44
2.8 Symbols of Grouping 48 Exercises 52
Chapter 3: Functions, Equations, and Graphs 59
3.1 Expressions 59
3.2 Functions 67
3.3 Equations 76
3.4 Linear Equations in One Unknown 78
3.5 Quadratic Equations in One Unknown 81
3.6 The Cartesian Plane 89
3.7 Linear Equations in Two Unknowns 93
3.8 Quadratic Equations in Two Unknowns 100 Exercises 106
Chapter 4: Systems of Linear Equations 113
4.1 Systems of Two Linear Equations 113
4.2 Determinants 123
4.3 Systems of Three or More Linear Equations 129 Exercises 138
Chapter 5: Matrices and Matrix Methods 143
5.1 The Matrix 143
5.2 Rank of a Matrix 146
5.3 Operations with Matrices 152
5.4 Inverse of a Matrix 160 Exercises 176
Chapter 6: Sequences, Series, and Number Bases 181
6.1 Sequences 181
6.2 Summations and Series 190
6.3 The Binary Number System 197
6.4 The Base 8 (Octal) Number System 210
6.5 Base 16 (Hexadecimal) Number System 214
Exercises 217
PART 2
Chapter 7: Elementary Logic and Set Theory 229
7.1 Propositions 229
7.2 Truth Tables 231
7.3 An Application of Truth Tables 234
7.4 Sets 236
7.5 Operations on Sets 238
7.6 Venn Diagrams 240
7.7 An Application of Set Theory 242
7.8 Truth Sets—The Connection between Logic and Set Theory 244
7.9 An Example of Truth Sets 246
Exercises 248
Chapter 8: Boolean Algebra 253
8.1 Boolean Variables 253
8.2 Boolean Operations 254
8.3 Algebraic Properties of Boolean Operations 255
8.4 Algebraic Simplification of Boolean Expressions 256
8.5 Boolean Operations with Computers 260
8.6 An Application of Boolean Algebra to Switching Circuits 265
Exercises 271
Chapter 9: Algorithms and Iterative Techniques 277
9.1 Square Root by Binary Chopping 280
9.2 Generation of Binomial Coefficients 283
9.3 A Binary Search 287
9.4 Matrix Inversion 291
9.5 Random Numbers and Buffon’s Needle Problem 296
9.6 The Game of Nim 302
9.7 Solutions of Simultaneous Linear Equations 307
Chapter 10: Computer Computation and Error Analysis 315
10.1 Historical Development of the Real Number System 315
10.2 Representation of Numbers within Computers 318
10.3 Accuracy and Error 324
10.4 Error Propagation 329
10.5 Some General Rules for Error Reduction 336 Exercises 337
PART 3
Chapter 11: Characteristics of Programming Languages 343
11.1 Machine Instructions 344
11.2 Problem-oriented Programming Languages 346
11.3 Processors 348
11.4 Structural Elements of Programming Languages 350
11.5 Backus Normal Form 354
11.6 Backus Normal Form Description of Boolean Algebra 356
11.7 Conclusion 360 Exercises 360
Chapter 12: FORTRAN 363
12.1 Arithmetic Statements 364
12.2 Control Statements 371
12.3 Declaration Statements 386
12.4 Input-Output Statements 397
12.5 Sample Problem 401 Exercises 404
Chapter 13: COBOL 407
13.1 The COBOL Program Divisions 408
13.2 The COBOL Structure 408
13.3 Files, Blocks, Records, and Items 410
13.4 A Simple Application 411
13.5 The COBOL Source Program 412
13.6 The COBOL Coding Form 439
13.7 Qualification 441
13.8 Notational Rules 443
13.9 Format-Identification Division 444
13.10 Format-Environment Division 444
13.11 Format-Data Division 447
13.12 Format-Procedure Division 450
13.13 Punctuation 464
Appendix 465
Exercises 467
Appendix: Answers to Selected Exercises 469
Index 479