NU Learning Resource Center OPAC catalog › Details for: The art of computer programming : combinatorial algorithms, part I /

Normal view MARC view ISBD view

The art of computer programming : combinatorial algorithms, part I / Donald Ervin Knuth

By: Knuth, Donald Ervin [author]Material type: Text

TextSeries: ; VOLUME 4APublication details: Boston : Addison-Wesley, c2011Description: [continuous pagings] : illustrations ; 24 cmISBN: 9780201038040Subject(s): ELECTRONIC DIGITAL COMPUTERS -- PROGRAMMING | COMPUTER ALGORITHMSLOC classification: QA 76.6 .K58 2011

Contents:

Chapter 7-Combinatorial Searching -- Answers to Exercises -- Appendixes -- Index and Glossary.

Summary: The book is Volume 4A, because Volume 4 has itself become a multivolume undertaking. Combinatorial searching is a rich and important topic, and Knuth has too much to say about it that is new, interesting, and useful to fit into a single volume, or two, or maybe even three. This book alone includes approximately 1500 exercises, with answers for self-study, plus hundreds of useful facts that cannot be found in any other publication. Volume 4A surely belongs beside the first three volumes of this classic work in every serious programmer’s library.

Item type:

Books

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 2 )
Title notes ( 3 )
Comments ( 0 )

Item type	Current library	Home library	Collection	Shelving location	Call number	Copy number	Status	Date due	Barcode
Books	LRC - Main	National University - Manila	Computer Engineering	General Circulation	GC QA 76.6 .K58 2011 vol.4a c.1 (Browse shelf (Opens below))	c.1	Available		NULIB000006817
Books	LRC - Main	National University - Manila	Computer Science	General Circulation	GC QA 76.6 .K58 2011 vol.4a c.2 (Browse shelf (Opens below))	c.2	Available		NULIB000009397

Includes bibliographical references and index.

Chapter 7-Combinatorial Searching -- Answers to Exercises -- Appendixes -- Index and Glossary.

The book is Volume 4A, because Volume 4 has itself become a multivolume undertaking. Combinatorial searching is a rich and important topic, and Knuth has too much to say about it that is new, interesting, and useful to fit into a single volume, or two, or maybe even three. This book alone includes approximately 1500 exercises, with answers for self-study, plus hundreds of useful facts that cannot be found in any other publication. Volume 4A surely belongs beside the first three volumes of this classic work in every serious programmer’s library.

There are no comments on this title.

to post a comment.