MARC details
000 -LEADER |
fixed length control field |
02859nam a22002537a 4500 |
003 - CONTROL NUMBER IDENTIFIER |
control field |
IIITD |
005 - DATE AND TIME OF LATEST TRANSACTION |
control field |
20250807180530.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
fixed length control field |
250729b |||||||| |||| 00| 0 eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9780201896831 |
040 ## - CATALOGING SOURCE |
Original cataloging agency |
IIITD |
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
Classification number |
005.1 |
Item number |
KNU-A |
100 ## - MAIN ENTRY--PERSONAL NAME |
Personal name |
Knuth, Donald E. |
245 ## - TITLE STATEMENT |
Title |
The art of computer programming : |
Remainder of title |
fundamental algorithm vol I |
Statement of responsibility, etc |
by Donald E. Knuth |
250 ## - EDITION STATEMENT |
Edition statement |
3rd ed. |
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
Place of publication, distribution, etc |
New york : |
Name of publisher, distributor, etc |
Addison-Wesley, |
Date of publication, distribution, etc |
©1997 |
300 ## - PHYSICAL DESCRIPTION |
Extent |
xix, 652 p. : |
Other physical details |
ill. ; |
Dimensions |
25 cm. |
500 ## - GENERAL NOTE |
General note |
includes index. |
505 ## - FORMATTED CONTENTS NOTE |
Title |
1. Basic concepts |
505 ## - FORMATTED CONTENTS NOTE |
Title |
2. Information structures |
520 ## - SUMMARY, ETC. |
Summary, etc |
The second volume offers a complete introduction to the field of seminumerical algorithms, with separate chapters on random numbers and arithmetic. The book summarizes the major paradigms and basic theory of such algorithms, thereby providing a comprehensive interface between computer programming and numerical analysis. The fourth volume introduces techniques that allow computers to deal efficiently with gigantic problems. Its coverage begins with Boolean functions and bitwise tricks and techniques, then treats in depth the generation of all tuples and permutations, all combinations and partitions, and all trees. --from publisher's description. The third volume comprises the most comprehensive survey of classical computer techniques for sorting and searching. It extends the treatment of data structures in Volume I to consider both large and small databases and internal and external memories. This first volume begins with basic programming concepts and techniques, then focuses 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. Knuth's multivolume work is widely recognized as the definitive description of classical computer science: at the end of 1999, these books were named among the best twelve physical-science monographs of the century by American Scientist. The three volumes included in this set have each been revised recently to reflect developments in the field. As earlier editions clearly demonstrated, they comprise an invaluable resource in programming theory and practice for students, researchers, and practitioners alike. Countless readers have spoken about the profound personal influence of Knuth's work. Scientists have marveled at the beauty and elegance of his analysis, while ordinary programmers have successfully applied his "cookbook" solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books. |
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) |
Source of classification or shelving scheme |
Dewey Decimal Classification |
Koha item type |
Books |