{"product_id":"art-of-computer-programming-the-9780201896831","title":"Art of Computer Programming The","description":"\u003cb\u003eBook Synopsis\u003c\/b\u003e\u003cbr\u003e\u003cp\u003e\u003cb\u003eDonald E. Knuth \u003c\/b\u003eis known throughout the world for his pioneering work on algorithms and programming techniques, for his invention of the Tex and Metafont systems for computer typesetting, and for his prolific and influential writing. Professor Emeritus of The Art of Computer Programming at Stanford University, he currently devotes full time to the completion of these fascicles and the seven volumes to which they belong.\u003c\/p\u003e \u003cbr\u003e \u003cbr\u003e\u003cbr\u003e\u003cbr\u003e\u003cb\u003eTable of Contents\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e \u003cbr\u003e \u003cb\u003e1. Basic Concepts.\u003c\/b\u003e \u003cbr\u003e \u003cp\u003e \u003c\/p\u003e   Algorithms.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Mathematical Preliminaries.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Mathematical Induction.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Numbers, Powers, and Logarithms.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Sums and Products.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Integer Functions and Elementary Number Theory.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Permutations and Factorials.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Binomial Coefficients.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Harmonic Numbers.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Fibonacci Numbers.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Generating Functions.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Analysis of an Algorithm.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Asymptotic Representations.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   MIX.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Description of MIX.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   The MIX Assembly Language.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Applications to Permutations.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Some Fundamental Programming Techniques.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Subroutines.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Coroutines.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Interpretive Routines.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Input and Output.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   History and Bibliography.  \u003cp\u003e\u003c\/p\u003e \u003cbr\u003e \u003cbr\u003e \u003cb\u003e2. Information Structures.\u003c\/b\u003e \u003cbr\u003e \u003cp\u003e \u003c\/p\u003e   Introduction.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Linear Lists.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Stacks, Queues, and Deques.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Sequential Allocation.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Linked Allocation.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Circular Lists.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Doubly Linked Lists.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Arrays and Orthogonal Lists.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Trees.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Traversing Binary Trees.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Binary Tree Representation of Trees.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Other Representations of Trees.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Basic Mathematical Properties of Trees.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Lists and Garbage Collection.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Multilinked Structures.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   Dynamic Storage Allocation.  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   History and Bibliography.  \u003cp\u003e\u003c\/p\u003e \u003cbr\u003e \u003cbr\u003e \u003cb\u003eAnswers to Exercises.\u003c\/b\u003e \u003cbr\u003e \u003cbr\u003e \u003cbr\u003e \u003cb\u003eAppendix A. Tables of Numerical Quantities.\u003c\/b\u003e \u003cbr\u003e \u003cp\u003e \u003c\/p\u003e   1. Fundamental Constants (decimal).  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   2. Fundamental Constants (octal).  \u003cp\u003e\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e   3. Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers.  \u003cp\u003e\u003c\/p\u003e \u003cbr\u003e \u003cbr\u003e \u003cb\u003eAppendix B. Index to Notations.\u003c\/b\u003e \u003cbr\u003e \u003cbr\u003e \u003cbr\u003e \u003cb\u003eIndex and Glossary. 0201896834T02272003\u003c\/b\u003e \u003cbr\u003e","brand":"Pearson Education (US)","offers":[{"title":"Default Title","offer_id":48864224739671,"sku":"9780201896831","price":53.54,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0817\/1739\/5799\/files\/9780201896831.jpg?v=1722270973","url":"https:\/\/bookcurl.com\/products\/art-of-computer-programming-the-9780201896831","provider":"Book Curl","version":"1.0","type":"link"}