The art of computer programming /

Saved in:
Bibliographic Details
Author / Creator:Knuth, Donald Ervin, 1938- author.
Imprint:Reading, Mass. : Addison-Wesley, [1997-]
Description:1 online resource (volumes <1-3, 4, fasc. 1, 5-6, 4A>) : illustrations.
Language:English
Subject:
Format: E-Resource Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/13699957
Hidden Bibliographic Details
ISBN:0201896834
9780201896831
0201853922
9780201853926
0201896842
9780201896848
0201896850
9780201896855
0321580508
9780321580504
0201853930
9780201853933
0201853949
9780201853940
0321335708
9780321335708
9780134397603
0134397606
9780201038040
0201038048
9780321751041
0321751043
9780134671796
0134671791
0201485419
9780201485417
Notes:Volumes 1-2: Third edition; volume 3: Second edition; volume 4A: First edition.
Volume 3 published 1998; volume 4A published 2011.
Portions of the text of volume 4 have been released as separate fascicles.
Includes indexes.
Description based on print version record.
Summary: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.
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 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.
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.
Other form:Print version: Knuth, Donald Ervin, 1938- Art of computer programming. Reading, Mass. : Addison-Wesley, ©1997- 0201896834