The art of computer programming: fundamental algorithms, volume 1 (Record no. 10249)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 03463nam a22002057a 4500 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 240606b |||||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9780201896831 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.1 |
| Item number | KNU |
| 100 ## - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Knuth, Donald Ervin |
| 245 ## - TITLE STATEMENT | |
| Title | The art of computer programming: fundamental algorithms, volume 1 |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 3rd ed. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication, distribution, etc. | Boston |
| Name of publisher, distributor, etc. | Addison-Wesley |
| Date of publication, distribution, etc. | 1997 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | xix, 652p. |
| Other physical details | hb. |
| 500 ## - GENERAL NOTE | |
| General note | https://www.pearson.com/en-us/subject-catalog/p/art-of-computer-programming-the-volume-1-fundamental-algorithms/P200000000378/9780201896831?tab=title-overview |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming.<br/>–Byte, September 1995<br/><br/>I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the line-up.<br/>–Charles Long<br/><br/>If you think you're a really good programmer... read [Knuth's] Art of Computer Programming... You should definitely send me a resume if you can read the whole thing.<br/>–Bill Gates<br/><br/>It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers.<br/>–Jonathan Laventhol<br/><br/>This first volume in the series begins with basic programming concepts and techniques, then focuses more particularly on information structures–the representation of information inside a computer, the structural relationships between data elements and how to deal with them efficiently. Elementary applications are given to simulation, numerical methods, symbolic computing, software and system design. Dozens of simple and important algorithms and techniques have been added to those of the previous edition. The section on mathematical preliminaries has been extensively revised to match present trends in research.<br/><br/>1. Basic Concepts.<br/>Algorithms.<br/>Mathematical Preliminaries.<br/>Mathematical Induction.<br/>Numbers, Powers, and Logarithms.<br/>Sums and Products.<br/>Integer Functions and Elementary Number Theory.<br/>Permutations and Factorials.<br/>Binomial Coefficients.<br/>Harmonic Numbers.<br/>Fibonacci Numbers.<br/>Generating Functions.<br/>Analysis of an Algorithm.<br/>Asymptotic Representations.<br/>MIX.<br/>Description of MIX.<br/>The MIX Assembly Language.<br/>Applications to Permutations.<br/>Some Fundamental Programming Techniques.<br/>Subroutines.<br/>Coroutines.<br/>Interpretive Routines.<br/>Input and Output.<br/>History and Bibliography.<br/><br/>2. Information Structures.<br/>Introduction.<br/>Linear Lists.<br/>Stacks, Queues, and Deques.<br/>Sequential Allocation.<br/>Linked Allocation.<br/>Circular Lists.<br/>Doubly Linked Lists.<br/>Arrays and Orthogonal Lists.<br/>Trees.<br/>Traversing Binary Trees.<br/>Binary Tree Representation of Trees.<br/>Other Representations of Trees.<br/>Basic Mathematical Properties of Trees.<br/>Lists and Garbage Collection.<br/>Multilinked Structures.<br/>Dynamic Storage Allocation.<br/>History and Bibliography.<br/><br/>Answers to Exercises.<br/><br/>Appendix A. Tables of Numerical Quantities.<br/>1. Fundamental Constants (decimal).<br/>2. Fundamental Constants (octal).<br/>3. Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers.<br/><br/>Appendix B. Index to Notations.<br/>Index and Glossary. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer science |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer Programming |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer Algorithms |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | Book |
| Withdrawn status | Lost status | Source of classification or shelving scheme | Damaged status | Not for loan | Collection code | bill no. | bill date | Home library | Current library | Date acquired | Source of acquisition | Cost, normal purchase price | Serial Enumeration / chronology | Total Checkouts | Full call number | Barcode | Date last seen | Cost, replacement price | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Dewey Decimal Classification | Computer science | 118/24-25 | 27/05/2024 | Plaksha University Library | Plaksha University Library | 06/06/2024 | T V Enterprises | 5609.20 | Vol. 1 | 005.1 KNU | 004920 | 06/06/2024 | 4767.93 | 06/06/2024 | Book |