My Account Log in

1 option

The art of computer programming / Donald E. Knuth.

O'Reilly Online Learning: Academic/Public Library Edition Available online

View online
Format:
Book
Author/Creator:
Knuth, Donald Ervin, 1938- author.
Language:
English
Subjects (All):
Computer programming.
Computer algorithms.
Physical Description:
1 online resource (volumes <1-3, 4, fasc. 1, 5-6, 4A>) : illustrations.
Place of Publication:
Reading, Mass. : Addison-Wesley, [1997-]
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.
Contents:
Vol. 1. Fundamental algorithms. Basic concepts ; Information structures
v. 2. Seminumerical algorithms. Random numbers ; Arithmetic
v. 3. Sorting and searching. Sorting ; Searching
v. 4, fascicle 1. Bitwise tricks & techniques : binary decision diagrams
v. 4, fascicle 5. Mathematical preliminaries redux ; Introduction to backtracking ; Dancing links
v. 4, fascicle 6. Satisfiability
v. 4A. Combinatorial algorithms. pt. 1. Combinatorial searching.
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.
OCLC-licensed vendor bibliographic record.
ISBN:
9780134671857
0134671856
OCLC:
1325677436

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account