Online Public Access Catalogue (OPAC)
Library,Documentation and Information Science Division

“A research journal serves that narrow

borderland which separates the known from the unknown”

-P.C.Mahalanobis


Normal view MARC view ISBD view

Concrete mathematics : a foundation for computer science / Ronald L. Graham, Donald E. Knuth and Oren Patashnik.

By: Graham, Ronald L [author].
Contributor(s): Knuth, Donald E [author] | Patashnik, Oren [author].
Material type: TextTextPublisher: Reading, Massachusetts : Addison-Wesley, ©1994Edition: 2nd ed.Description: xiii, 657 pages : illustrations ; 24 cm.ISBN: 0201558025; 9780201558029.Subject(s): Mathematics | Computer science -- MathematicsDDC classification: 510
Contents:
1. Recurrent problems : The Tower of Hanoi ; Lines in the plane ; The Josephus problem -- 2. Sums : Notation ; Sums and recurrences ; Manipulation of sums ; General methods ; Finite and infinite calculus ; Infinite sums -- 3. Integer functions : Floors and ceilings ; Floor/ceiling applications ; Floor/ceiling recurrences ; 'mod': the binary operation ; Floor/ceiling sums -- 4. Number theory : Divisibility ; Primes ; Prime examples ; Factorial factors ; Relative primality ; 'mod': the congruence relation ; Independent residues ; Additional applications ; Phi and mu -- 5. Binomial coefficients : Basic identities ; Basic practice ; Tricks of the trade ; Generating functions ; Hypergeometric functions ; Hypergeometric transformations ; Partial hypergeometric sums ; Mechanical summation -- 6. Special numbers : Stirling numbers ; Eulerian numbers ; Harmonic numbers ; Harmonic summation ; Bernoulli numbers ; Fibonacci numbers ; Continuants -- 7. Generating functions : Domino theory and change ; Basic maneuvers ; Solving recurrence ; Special generating functions ; Convolutions ; Exponential generating functions ; Dirichlet generating functions -- 8. Discrete probability : Definitions ; Mean and variance ; Probability generating functions ; Flipping coins ; Hashing -- 9. Asymptotics : A hierarchy ; O notation ; O manipulation ; Two asymptotic tricks ; Euler's summation formula ; Final summations.
Summary: Introduces the mathematics that supports advanced computer programming and the analysis of algorithms. This book includes more than 500 exercises, divided into six categories. Complete answers are provided for all exercises, except research problems. It is useful for computer scientists and also for users of mathematics in various disciplines.
Tags from this library: No tags from this library for this title. Log in to add tags.
Item type Current location Call number Status Date due Barcode Item holds
Books Books ISI Library, Kolkata
 
510 G741 (Browse shelf) Available C26576
Total holds: 0

Includes bibliographical references and index.

1. Recurrent problems : The Tower of Hanoi ; Lines in the plane ; The Josephus problem --
2. Sums : Notation ; Sums and recurrences ; Manipulation of sums ; General methods ; Finite and infinite calculus ; Infinite sums --
3. Integer functions : Floors and ceilings ; Floor/ceiling applications ; Floor/ceiling recurrences ; 'mod': the binary operation ; Floor/ceiling sums --
4. Number theory : Divisibility ; Primes ; Prime examples ; Factorial factors ; Relative primality ; 'mod': the congruence relation ; Independent residues ; Additional applications ; Phi and mu --
5. Binomial coefficients : Basic identities ; Basic practice ; Tricks of the trade ; Generating functions ; Hypergeometric functions ; Hypergeometric transformations ; Partial hypergeometric sums ; Mechanical summation --
6. Special numbers : Stirling numbers ; Eulerian numbers ; Harmonic numbers ; Harmonic summation ; Bernoulli numbers ; Fibonacci numbers ; Continuants --
7. Generating functions : Domino theory and change ; Basic maneuvers ; Solving recurrence ; Special generating functions ; Convolutions ; Exponential generating functions ; Dirichlet generating functions --
8. Discrete probability : Definitions ; Mean and variance ; Probability generating functions ; Flipping coins ; Hashing --
9. Asymptotics : A hierarchy ; O notation ; O manipulation ; Two asymptotic tricks ; Euler's summation formula ; Final summations.

Introduces the mathematics that supports advanced computer programming and the analysis of algorithms. This book includes more than 500 exercises, divided into six categories. Complete answers are provided for all exercises, except research problems. It is useful for computer scientists and also for users of mathematics in various disciplines.

There are no comments for this item.

Log in to your account to post a comment.

Other editions of this work

Concrete mathematics by Graham Ronald L
Library, Documentation and Information Science Division, Indian Statistical Institute, 203 B T Road, Kolkata 700108, INDIA
Phone no. 91-33-2575 2100, Fax no. 91-33-2578 1412, ksatpathy@isical.ac.in


Visitor Counter