| 000 | 10738cam a2202677 i 4500 | ||
|---|---|---|---|
| 001 | 1955248 | ||
| 008 | 191227s19731973nju a 001 0 eng d | ||
| 020 |
_a0131660829 _q(hardback) |
||
| 040 |
_aTR-IsMEF _beng _erda _cTR-IsMEF |
||
| 041 | 0 | _aeng | |
| 049 | _aTR-IsMEF | ||
| 050 | 0 | 0 |
_aQA76.6 _b.A53 1973 |
| 100 | 1 |
_aAndree, Richard V. _q(Richard Vernon), _d1919-1987 _eauthor. |
|
| 245 | 1 | 0 |
_aComputer programming : _btechniques, analysis, and mathematics / _cRichard V. Andree Professor of Mathematics Professor of Information and Computing Sciences The University of Oklahoma ; Josephine P. Andree ; David D. Andree. |
| 264 | 1 |
_aEnglewood Cliffs, N.J. : _bPrentice-Hall, _c1973. |
|
| 300 |
_axvii, 549 pages : _billustrations ; _c25 cm. |
||
| 336 |
_atext _2rdacontent |
||
| 337 |
_aunmediated _2rdamedia |
||
| 338 |
_avolume _2rdacarrier |
||
| 490 | 1 | _aPrentice-Hall series in automatic computation. | |
| 500 | _aIncludes index. | ||
| 650 | 0 | _aComputer programming | |
| 650 | 0 |
_aMathematics _xData processing |
|
| 700 | 1 |
_aAndree, Josephine P., _eauthor. |
|
| 700 | 1 |
_aAndree, David D., _eauthor. |
|
| 830 | 0 | _aPrentice-Hall series in automatic computation. | |
| 900 | _aMEF Üniversitesi Kütüphane katalog kayıtları RDA standartlarına uygun olarak üretilmektedir / MEF University Library Catalogue Records are Produced Compatible by RDA Rules | ||
| 920 |
_aUral, Oktay, _edonor. |
||
| 942 |
_2lcc _cBKS |
||
| 970 | 0 | 1 | _tCONTENTS |
| 970 | 1 | 2 |
_lChapter 1 _tINTRODUCING AND THE READING OF FORTRAN IV (2 or 3 lessons, emphasizing Sections 1-9, 1-10.), _p1 |
| 970 | 1 | 1 |
_l1-1 _tIntroduction, _p1 |
| 970 | 1 | 1 |
_l1-2 _tThe Computer, _p3 |
| 970 | 1 | 1 |
_tOrganization of a Computer, _p3 |
| 970 | 1 | 1 |
_tThe Reliability of Modern Computers, _p7 |
| 970 | 1 | 1 |
_tThe Terminal, _p7 |
| 970 | 1 | 1 |
_tThe Keypunch, _p8 |
| 970 | 1 | 1 |
_tProblem Set 1-2, _p10 |
| 970 | 1 | 1 |
_l1-3 _tReading Basic FORTRAN IV, _p11 |
| 970 | 1 | 1 |
_l1-4 _tClosed-Shop Operations, _p18 |
| 970 | 1 | 1 |
_tProblem Set 1-4, _p23 |
| 970 | 1 | 1 |
_l1-5 _tMore on Reading FORTRAN, _p31 |
| 970 | 1 | 1 |
_l1-6 _tMore General Programs, _p37 |
| 970 | 1 | 1 |
_tProblem Set 1-6, _p41 |
| 970 | 1 | 1 |
_l1-7 _tA Moving Average, _p43 |
| 970 | 1 | 1 |
_tProblem Set 1-7, _p47 |
| 970 | 1 | 1 |
_l1-8 _tA Bit More Sophistication, _p49 |
| 970 | 1 | 1 |
_l1-9 _tWriting FORTRAN, _p50 |
| 970 | 1 | 1 |
_tAcceptable Arithmetic Operations, _p51 |
| 970 | 1 | 1 |
_tAcceptable Functions, _p51 |
| 970 | 1 | 1 |
_tOther Acceptable Instructions, _p52 |
| 970 | 1 | 1 |
_tOther Conventions, _p54 |
| 970 | 1 | 1 |
_l1-10 _tSeven Steps of a Complete Computer Program, _p56 |
| 970 | 1 | 1 |
_tProblem Set 1-10, _p58 |
| 970 | 1 | 2 |
_lChapter 2 _tCOMPUTING IN FORTRAN IV (6 to 8 lessons), _p65 |
| 970 | 1 | 1 |
_l2-1 _tErrors in Computations, _p65 |
| 970 | 1 | 1 |
_tProblem Set 2-1, _p70 |
| 970 | 1 | 1 |
_l2-2 _tExponential Notation, _p71 |
| 970 | 1 | 1 |
_l2-3 _tSome Strange Arithmetic, _p75 |
| 970 | 1 | 1 |
_l2-4 _tRounding, _p77 |
| 970 | 1 | 1 |
_tProblem Set 2-4, _p79 |
| 970 | 1 | 1 |
_l2-5 _tNumbers, Variables, and FORMAT, _p81 |
| 970 | 1 | 1 |
_tIntegers, _p81 |
| 970 | 1 | 1 |
_tFloating-Point Numbers, _p82 |
| 970 | 1 | 1 |
_tThe WX Specifications, _p84 |
| 970 | 1 | 1 |
_tProblem Set 2-5, _p84 |
| 970 | 1 | 1 |
_l2-6 _tDiagnostic Messages, _p87 |
| 970 | 1 | 1 |
_l2-7 _tThe Fibonacci Sequence, _p89 |
| 970 | 1 | 1 |
_tProblem Set 2-7, _p93 |
| 970 | 1 | 1 |
_l2-8 _tThe Branch Instruction, _p98 |
| 970 | 1 | 1 |
_tArithmetic I F Instruction, _p100 |
| 970 | 1 | 1 |
_tBoolean (Logical) I F Instruction, _p101 |
| 970 | 1 | 1 |
_tProblem Set 2-8 _t104 |
| 970 | 1 | 1 |
_l2-9 _tWriting Headings and Messages Using FORMAT Statements, _p105 |
| 970 | 1 | 1 |
_tH-Format in WRITE Statements, _p105 |
| 970 | 1 | 1 |
_tH-Format in READ Statements, _p107 |
| 970 | 1 | 1 |
_tA-Format, _p109 |
| 970 | 1 | 1 |
_tProblem Set 2-9, _p111 |
| 970 | 1 | 1 |
_l2-10 _tPlotting Graphs (Optional), _p118 |
| 970 | 1 | 1 |
_lProblem Set 2-10, _p122 |
| 970 | 1 | 1 |
_l2-11 _tFlow Charts, _p123 |
| 970 | 1 | 1 |
_tProblem Set 2-11, _p125 |
| 970 | 1 | 1 |
_l2-12 _tSaving Time and $, _p131 |
| 970 | 1 | 1 |
_tProblem Set 2-12, _p132 |
| 970 | 1 | 2 |
_lChapter 3 _tSUBSCRIPTS AND DO LOOPS (3 or 4 lessons), _p135 |
| 970 | 1 | 1 |
_l3-1 _tThe DO Statement, _p135 |
| 970 | 1 | 1 |
_tProblem Set 3-1, _p144 |
| 970 | 1 | 1 |
_l3-2 _tA Bit More Sophistication, _p146 |
| 970 | 1 | 1 |
_l3-3 _tFurther Applications of the DO Statement, _p147 |
| 970 | 1 | 1 |
_tProblem Set 3-3, _p150 |
| 970 | 1 | 1 |
_l3-4 _tSubscripted Variables, _p153 |
| 970 | 1 | 1 |
_tProblem Set 3-4, _p158 |
| 970 | 1 | 1 |
_l3-5 _tThe Computer in Our Society, _p164 |
| 970 | 1 | 1 |
_tComputer Music, _p167 |
| 970 | 1 | 2 |
_lChapter 4 _tADVANCED PROGRAMMING TECHNIQUES (6 to 8 lessons), _p171 |
| 970 | 1 | 1 |
_l4-1 _tSolution of Equations, _p171 |
| 970 | 1 | 1 |
_tProblem Set 4-1, _p173 |
| 970 | 1 | 1 |
_l4-2 _tSolution of Simultaneous Linear Equations, _p181 |
| 970 | 1 | 1 |
_tProblem Set 4-2, _p187 |
| 970 | 1 | 1 |
_l4-3 _tFORMAT Statements, _p194 |
| 970 | 1 | 1 |
_tProblem Set 4-3, _p195 |
| 970 | 1 | 1 |
_l _4-4 _tAdditional Instructions (Optional), _p199 |
| 970 | 1 | 1 |
_tThe Computed GO TO, _p200 |
| 970 | 1 | 1 |
_tThe INTEGER Statement, _p200 |
| 970 | 1 | 1 |
_tThe REAL Statement, _p201 |
| 970 | 1 | 1 |
_tThe DOUBLE PRECISION Statement, _p201 |
| 970 | 1 | 1 |
_tThe COMPLEX Statement, _p201 |
| 970 | 1 | 1 |
_tThe LOGICAL Statement, _p202 |
| 970 | 1 | 1 |
_tArrays with the INTEGER, REAL, DOUBLE PRECISION, COMPLEX, or LOGICAL Statements, _p202 |
| 970 | 1 | 1 |
_tThe IMPLICIT Statement, _p203 |
| 970 | 1 | 1 |
_tEQUIVALENCE Statements, _p203 |
| 970 | 1 | 1 |
_tDEFINE FILE Statements, _p204 |
| 970 | 1 | 1 |
_tUnformatted File READ and WRITE Statements, _p204 |
| 970 | 1 | 1 |
_tA Mathematical Aside, _p205 |
| 970 | 1 | 1 |
_tProblem Set 4-4, _p207 |
| 970 | 1 | 1 |
_l4-5 _tMore FORTRAN, _p215 |
| 970 | 1 | 1 |
_tProblem Set 4-5, _p215 |
| 970 | 1 | 2 |
_lChapter 5 _tSIMULATION (5 to 7 lessons), _p223 |
| 970 | 1 | 1 |
_l5-1 _tResearch Using Computers, _p223 |
| 970 | 1 | 1 |
_l5-2 _tPseudo-Random Numbers, _p224 |
| 970 | 1 | 1 |
_tProblem Set 5-2, _p229 |
| 970 | 1 | 1 |
_l5-3 _tSecret Messages, _p230 |
| 970 | 1 | 1 |
_tProblem Set 5-3, _p232 |
| 970 | 1 | 1 |
_l5-4 _tDorm Dance Problem, _p232 |
| 970 | 1 | 1 |
_tProblem Set 5-4, _p241 |
| 970 | 1 | 1 |
_l5-5, _tSimulation, _p241 |
| 970 | 1 | 1 |
_tBacteria in Samples (1), _p242 |
| 970 | 1 | 1 |
_tBacteria in Samples (2), _p246 |
| 970 | 1 | 1 |
_tProblem Set 5-5, _p253 |
| 970 | 1 | 1 |
_l5-6 _tMore Sophisticated Simulations, _p254 |
| 970 | 1 | 1 |
_tBug 1 on a Cube, _p254 |
| 970 | 1 | 1 |
_tBug 2 on a Cube, _p260 |
| 970 | 1 | 1 |
_tBug 3 on a Cube, _p264 |
| 970 | 1 | 1 |
_tProblem Set 5-6, _p271 |
| 970 | 1 | 1 |
_l5-7 _tEhrenfest Molecular Model, _p271 |
| 970 | 1 | 1 |
_tAnother Model, _p276 |
| 970 | 1 | 1 |
_tIsomorphisms, _p277 |
| 970 | 1 | 1 |
_tProblem Set 5-7, _p277 |
| 970 | 1 | 1 |
_l5-8 _tOther Monte Carlo Techniques, _p279 |
| 970 | 1 | 1 |
_tProblem Set 5-8, _p280 |
| 970 | 1 | 2 |
_lChapter 6 _tNUMERICAL METHODS (4 to 6 lessons), _p283 |
| 970 | 1 | 1 |
_l6-1 _tThe Distribution of Floating-Point Numbers, _p283 |
| 970 | 1 | 1 |
_l6-2 _tSome Vital Numerical Analysis, _p285 |
| 970 | 1 | 1 |
_tProblem Set 6-2, _p292 |
| 970 | 1 | 1 |
_l6-3 _tMathematical Analysis of Computer Problems, _p297 |
| 970 | 1 | 1 |
_tProblem Set 6-3, _p305 |
| 970 | 1 | 1 |
_l6-4 _tOperation Bootstrap in Computing Programming, _p306 |
| 970 | 1 | 1 |
_l6-5 _tA Failure-So Far, _p313 |
| 970 | 1 | 1 |
_l6-6 _tBig Troubles from Little Errors, _p314 |
| 970 | 1 | 1 |
_l6-7 _tSensitivity of Coefficients, _p318 |
| 970 | 1 | 1 |
_tProblem Set 6-7, _p320 |
| 970 | 1 | 1 |
_l6-8 _tThe √ Function, _p321 |
| 970 | 1 | 1 |
_l6-9 _tApproximating Functions in General, _p322 |
| 970 | 1 | 1 |
_tProblem Set 6-9, _p326 |
| 970 | 1 | 1 |
_l6-10 _tApproximating the Area Under a Curve, _p327 |
| 970 | 1 | 1 |
_tProblem Set 6-10, _p332 |
| 970 | 1 | 1 |
_l6-11 _tAn Interogation Problem, _p332 |
| 970 | 1 | 2 |
_lChapter 7 _tSUBPROGRAMS (4 to 6 lessons), _p335 |
| 970 | 1 | 1 |
_l7-1 _tIntroduction, _p335 |
| 970 | 1 | 1 |
_tProblem Set 7-1, _p339 |
| 970 | 1 | 1 |
_l7-2 _tWriting Your Own FORTRAN Subprograms, _p339 |
| 970 | 1 | 1 |
_tStatement Functions, _p341 |
| 970 | 1 | 1 |
_tFunction Supbrograms, _p343 |
| 970 | 1 | 1 |
_tThe EXTERNAL Statement, _p345 |
| 970 | 1 | 1 |
_tSubroutine Programs, _p348 |
| 970 | 1 | 1 |
_tProblem Set 7-2, _p353 |
| 970 | 1 | 1 |
_l7-3 _tThe COMMON Statement, _p353 |
| 970 | 1 | 1 |
_tProblem Set 7-3, _p355 |
| 970 | 1 | 1 |
_l7-4 _tArray Arguments, _p355 |
| 970 | 1 | 1 |
_tProblem Set 7-4, _p361 |
| 970 | 1 | 1 |
_l7-5 _tScientific Subroutine Package, _p361 |
| 970 | 1 | 1 |
_tProblem Set 7-5, _p366 |
| 970 | 1 | 1 |
_l7-6 _tPlot Routines, _p366 |
| 970 | 1 | 1 |
_tProblem Set 7-6, _p372 |
| 970 | 1 | 2 |
_lChapter 8 _tASSEMBLY LANGUAGE PROGRAMMING(2 to 4 lessons), _p375 |
| 970 | 1 | 1 |
_l8-1 _tIntroduction, _p375 |
| 970 | 1 | 1 |
_l8-2 _tThe Concept of a One-Address Machine, _p376 |
| 970 | 1 | 1 |
_tIndex Registers, _p378 |
| 970 | 1 | 1 |
_tIndirect Addressing, _p379 |
| 970 | 1 | 1 |
_tProblem Set 8-2, _p380 |
| 970 | 1 | 1 |
_l8-3 _t1130 Hardware, _p380 |
| 970 | 1 | 1 |
_l8-4 _tInstructions, _p381 |
| 970 | 1 | 1 |
_tShort Instruction FORMAT, _p381 |
| 970 | 1 | 1 |
_tLong Instruction FORMAT, _p381 |
| 970 | 1 | 1 |
_l8-5 _tSpecial Registers, _p382 |
| 970 | 1 | 1 |
_l8-6 _tArithmetic Operations, _p382 |
| 970 | 1 | 1 |
_l8-7 _tEffective Address Generation, _p382 |
| 970 | 1 | 1 |
_l8-8 _tThe Basic Instruction Set, _p383 |
| 970 | 1 | 1 |
_l8-9 _tCoding in Assembly Language, _p388 |
| 970 | 1 | 1 |
_l8-10 _tControl Card Stacking, _p394 |
| 970 | 1 | 1 |
_tProblem Set 8-10, _p395 |
| 970 | 1 | 1 |
_l8-11 _tIndexing Using Index Registers, _p396 |
| 970 | 1 | 1 |
_tProblem Set 8-11, _p398 |
| 970 | 1 | 1 |
_l8-12 _tProgram Relocation, _p398 |
| 970 | 1 | 1 |
_tAbsolute Expressions, _p400 |
| 970 | 1 | 1 |
_tRelocatable Expressions, _p400 |
| 970 | 1 | 1 |
_tThe EQU Pseudo-Operation, _p400 |
| 970 | 1 | 1 |
_tProblem Set 8-12, _p401 |
| 970 | 1 | 1 |
_l8-13 _tFloating-Point Operations, _p401 |
| 970 | 1 | 1 |
_tStandard Precision Floating-Point Format, _p403 |
| 970 | 1 | 1 |
_tFloating-Point Arithmetic Subroutines, _p404 |
| 970 | 1 | 1 |
_tProblem Set 8-13, _p409 |
| 970 | 1 | 1 |
_l8-14 _tData Definition Instructions, _p409 |
| 970 | 1 | 1 |
_tProblem Set 8-14, _p411 |
| 970 | 1 | 1 |
_l8-15 _tSome Additional User-Created Subroutines, _p412 |
| 970 | 1 | 1 |
_t1130 CLOCK, _p412 |
| 970 | 1 | 1 |
_tMultiple Precision Integer Arithmetic, _p414 |
| 970 | 1 | 1 |
_tDCODE, _p415 |
| 970 | 1 | 1 |
_tProblem Set 8-15, _p415 |
| 970 | 1 | 2 |
_lChapter 9 _tCONCLUSION (1 or 2 lessons), _p419 |
| 970 | 1 | 1 |
_l9-1 _tWhat Is and What Is Not a Good Computing Problem?, _p419 |
| 970 | 1 | 1 |
_l9-2 _tPreliminary Analysis, _p420 |
| 970 | 1 | 1 |
_l9-3 _tSaving Computer Time at the Coding Level, _p421 |
| 970 | 1 | 1 |
_tGood Practice Hints, _p422 |
| 970 | 1 | 1 |
_l9-4 _tWhat to Study Next, _p426 |
| 970 | 1 | 1 |
_tCourses Recommended for Data Processing, _p426 |
| 970 | 1 | 1 |
_tCourses Recommended for Scientific Computing, _p426 |
| 970 | 1 | 1 |
_tCourses for Computing as a Discipline, _p426 |
| 970 | 1 | 1 |
_l9-5 _tSuggested Reading List for Self-Study, _p427 |
| 970 | 1 | 1 |
_tJournals, _p427 |
| 970 | 1 | 1 |
_tBooks, _p429 |
| 970 | 1 | 1 |
_tManuals, _p431 |
| 970 | 0 | 1 |
_aANSWERS, _p433 |
| 970 | 0 | 1 |
_aINDEX, _p543 |
| 999 |
_c8598 _d8598 |
||
| 003 | KOHA | ||