Problem solving by digital computers with PL/I Programming / Andrew Vazsonyi

1. How computers “solve” problems – 1.1 The role of computers in problem solving – 1.2 Check balancing problem: a case study – 1.3 PL/I Program for the check balancing calculation – 1.4 Analysis of the check balancing program – 1.5 Critique of check balancing program – 1.6 The biling calculation: how to multiply - -1.7 Calculating the average weekly temperature: how to divide – 1.8 The compound interest calculation: how to exponentiate – 1.9 Review of programs si far discussed – 1.10 The commission problem: a branching program – 1.11 Preparing an invoice: remembering numbers – 1.12 Check balancing program showing overdraw of account – 1.13 Mnemonic notation – 1.14 Review of programming languages – 1.15 Exercises – 2. Elementary problem solving – 2.1 How to solve it – 2.2 Review of problems so far discussed – 2.3 Computer lingo – 2.4 Evaluating algebraic expressions – 2.5 The dervish and the camels: Integer Arithmetic – 2.6 Check balancing calculation revisited: working with customers and pennies – 2.7 Commission problem revisited: rounding to the penny – 2.8 Working with triangles ad trigonometry – 2.9 Is this triangle isosceles? – 2.10 To eat or not to eat – 2.11 Evaluation of algebraic expressions revisited: parametric forms and data checking – 2.12 Who is taller? – 2.13 Computing the height of a building – 2.14 What is your phone number? – 2.15 Pretty girls – 2.16 solving two linear equations with two unknowns – 2.17 Solving a Quadratic equation – 2.18 Perpetual calendar: what day of the week is it? – 2.19 Further PL/I language features – 2.20 The preamble ad go-between sheets – 2.21 Handwritten characters – 2.22 Debugging of programs – 2.23 How to use this book – 2.24 Exercises – 3. File-oriented problems – 3.1 Separating boys and girls: creating and processing sequential files – 3.2 Check balancing problem: updating a master file – 3.3 Check balancing problem: updating a master file and creating a daily transaction file – 3.4 Collective names, qualified names, and structures – 3.5 Sales record of materials sold: updating a master file and creating a daily transaction file – 3.6 Merging two files – 3.7 The endfile problem and the on condition – 3.8 Sorting of files – 3.9 A Department Store Problem: the use of magnetic disks – 3.10 The picture attribute – 3.11 Exercises – 4. Loops and arrays – 4.1 Totaling a sales record: how to keep tally – 4.2 Computation of an engineering table – 4.3 4.3 Congressional vote: How to count – 4.4 Tabulating compound interest – 4.5 Computing the average of N numbers with a DO Loop – 4.6 The use of arrays – 4.8 The rabbits of Fibronacci: a simple difference equation – 4.9 Computation of an engineering table again: further use of arrays – 4.10 Three further illustrations for the use of arrays: computing the average and the standard deviation – 4.11 Working with arrays – 4.12 An exercise in integral calculus – 4.13 Smallest and biggest of N numbers – 4.14 Who is tallest – 4.15 Billing sales for coded materials – 4.16 Computing the federal income tax – 4.17 Billing sales amount by table look-up – 4.18 Frequency count of people’s ages – 4.19 Determining the salary distribution of employees – 4.20 The toils of napier – 4.21 Sales analysis of material sold – 4.22 Sorting data into ascending sequence – 4.23 Sales analysis by month and year of material sold – 4.24 Temperature calculation again: analysis of daily temperatures – 4.25 Computation of raw material requirements by matrix multiplication: the gozino theorem – 4.26 Sales analysis by salesmen product, customer, and year – 4.27 Finding phone numbers – 4.28 A table look-up binary search – 4.29 Randomized table look-up procedure – 4.30 Further PL/I Language features – 4.31 Exercises – 5. Procedures and functions – 5.1 What are subroutine procedures? 5.2 What are function procedures? – 5.3 Arguments and parameters – 5.4 Recognition of names – 5.5 table Look-up by invoking a function – 5.6 Procedures with secondary entry points – 5.7 The tallest, shortest and fattest man – 5.8 Solving the quadratic equation again – 5.9 Euclid’s algorithm to compute the greatest common divisor – 5.10 Recursive procedures – 5.11 Dummy arguments – 5.12 The secret code problem – 5.13 An elementary compiler – 5.14 Procedures that operate on procedures – 5.15 External procedures – 5.16 Data verification – 5.17 Excercises – Appendix – 6 – Mathematical background – 6.1 History of number systems – 6.2 Fixed-point numbers – 6.3 Floating-point numbers – 6.4 binary numbers – 6.5 Conversion of decimal numbers into binary numbers – 6.6 Binary addition – 6.7 Binary fractions – 6.8 Binary multiplication, substraction, and division – 6.9 Other number systems – 6.10 Character and bit strings – 6.11 Arithmetic operations 6.14 Inequalities and comparison operators – 6.15 bit string operators and Boolean algebra – 6.16 Concatination operator – 6.17 The Mathematics of arrays – 6.18 Random and pseudo random numbers – 6.19 Ill-Conditioned problems – 6.20 Exercises – 7. Scientific problem solving – 7.1 Root and equation by binary search – 7.2 Integration by Simpson’s rule – 7.3 Gauss-Seidel iteration method for solving linear equations – 7.4 Gauss’ Elimination method – 7.5 Matrix inversion – 7.6 Matrix algebra – 7.7 Linear and quadratic interpolation – 7.8 Lagrangian interpolation – 7.9 Solving ordinary differential equation by the Runge-Kutta Method – 7.10 Integration of partial differential equation – 7.11 Partial differential equations of parabolic type – 7.12 Partial differential equations of hyperbolic type – 7.13 Eigenvalue problems – 7.14 Fourier series expansion – 7.15 Working with prime numbers – 7.16 The algebra of polynomials – 7.17 The Ackermann function – 7.18 Error analysis – 7.19 Exercises – 8. Simulation of Stochastic process – 8.1 Matching pennies – 8.2 Monte carlo Method for computing π – 8.3 Throwing dice – 8.4 a simple waiting-line problem – 8.5 A simple random-walk – 8.6 Playing craps – 8.7Wating line with fixed service time – 8.8 Matching random arrays – 8.9 Simulation of an inventory control system – 8.10 Exercises – 9. How digital computers work – 9.1 The digital computer and its ancestor the desk calculator – 9.2 Programming an arithmetic automaton – 9.3 Logic versus Hardware – 9.4 Automation of storage – 9.5 The input and output automata – 9.6 Semiautomatic computers – 9.7 Externally programmed computers – 9.8 Internally programmed computers – 9.9 Programming of Digital computers – 9.10 Programming the IBM/360 computer – 9.11 Assemblers and compilers – 9.12 Modern digital computers – 9.13 Hierarchy of automatation of problems solving – 9.14Excercises – 10. Problems solving by remote terminals – 10.1 On-line/Real time – 10.2 Illustrative problem solving – 10.3 Introduction to program composition in the Basic language – 10.4 Further illustrations of program composition – 10.5 Manipulating Character strings – 10.6 Loops and iterations – 10.7 Subroutines, functions, and additional BASIC language features – 10.8 Exercises – 11. PL7I Syntax and quick reference – 11.1 Sintax notations – 11.2 Syntax for chapters 1 and 2 – 11.3 Syntax used in chapter 3 – 11.4 Syntax used in chapter 4 – 11.5 Function and subroutine procedures – 11.6 Built-it functions – Glossary – Symbolic and Mathematical notation - Index

This book is written for those who need to solve problems with the aid of digital computers. It is organized around a set of key problems , each explicity defined and solved. In most cases, the computer program and the printout obtained from the computer, are included. A large number of problems and exercises are includes to make it possible to verify and extend the knowledge obtained / Este libro está escrito para aquellos que necesitan resolver problemas con la ayuda de las computadoras digitales. Está organizado en torno a un conjunto de problemas, cada uno de ellos definido y resuelto explícitamente. En la mayoría de los casos, se incluye el programa de la computadora y la impresión obtenida en la misma. También se incluyen una gran cantidad de problemas y ejercicios para que sea posible verificar y ampliar los conocimientos adquiridos.