Art of Computer Programming, The
Home > Computing and Information Technology > Computer programming / software engineering > Algorithms and data structures > Art of Computer Programming, The: Volume 1: Fundamental Algorithms
Art of Computer Programming, The: Volume 1: Fundamental Algorithms

Art of Computer Programming, The: Volume 1: Fundamental Algorithms

|
     0     
5
4
3
2
1




Out of Stock


Notify me when this book is in stock
About the Book

&>The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming. —Byte, September 1995   I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the line-up. —Charles Long   If you think you're a really good programmer... read [Knuth's] Art of Computer Programming... You should definitely send me a resume if you can read the whole thing. —Bill Gates   It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers. —Jonathan Laventhol   This first volume in the series begins with basic programming concepts and techniques, then focuses more particularly 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. Dozens of simple and important algorithms and techniques have been added to those of the previous edition. The section on mathematical preliminaries has been extensively revised to match present trends in research. Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP),http://msp.org

Table of Contents:
1. Basic Concepts. Algorithms. Mathematical Preliminaries. Mathematical Induction. Numbers, Powers, and Logarithms. Sums and Products. Integer Functions and Elementary Number Theory. Permutations and Factorials. Binomial Coefficients. Harmonic Numbers. Fibonacci Numbers. Generating Functions. Analysis of an Algorithm. Asymptotic Representations. MIX. Description of MIX. The MIX Assembly Language. Applications to Permutations. Some Fundamental Programming Techniques. Subroutines. Coroutines. Interpretive Routines. Input and Output. History and Bibliography. 2. Information Structures. Introduction. Linear Lists. Stacks, Queues, and Deques. Sequential Allocation. Linked Allocation. Circular Lists. Doubly Linked Lists. Arrays and Orthogonal Lists. Trees. Traversing Binary Trees. Binary Tree Representation of Trees. Other Representations of Trees. Basic Mathematical Properties of Trees. Lists and Garbage Collection. Multilinked Structures. Dynamic Storage Allocation. History and Bibliography. Answers to Exercises. Appendix A. Tables of Numerical Quantities. 1. Fundamental Constants (decimal). 2. Fundamental Constants (octal). 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers. Appendix B. Index to Notations. Index and Glossary. 0201896834T02272003


Best Sellers


Product Details
  • ISBN-13: 9780133488784
  • Publisher: Pearson Education (US)
  • Publisher Imprint: Addison Wesley
  • Language: English
  • Sub Title: Volume 1: Fundamental Algorithms
  • ISBN-10: 0133488780
  • Publisher Date: 04 Jul 1997
  • Binding: Digital download
  • No of Pages: 672
  • Weight: 1 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Art of Computer Programming, The: Volume 1: Fundamental Algorithms
Pearson Education (US) -
Art of Computer Programming, The: Volume 1: Fundamental Algorithms
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Art of Computer Programming, The: Volume 1: Fundamental Algorithms

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!