Brand newLOWEST PRICE
- AU $93.95+ AU $50.00 postage
- Brand new condition
- Sold by ausreseller
- See details for delivery est.
- AU $51.94+ AU $4.99 postage
- Good condition
- Sold by whattaplace
- See details for delivery est.
All listings for this product
Best-selling in Textbooks
Save on Textbooks
- AU $37.79Trending at AU $65.19
- AU $68.00Trending at AU $71.53
- AU $105.99Trending at AU $107.61
- AU $100.89Trending at AU $103.04
- AU $68.00Trending at AU $80.61
- AU $105.90Trending at AU $116.86
- AU $110.99Trending at AU $112.12
About this product
- DescriptionExplores the Impact of the Analysis of Algorithms on Many Areas within and beyond Computer Science A flexible, interactive teaching format enhanced by a large selection of examples and exercises Developed from the author's own graduate-level course, Methods in Algorithmic Analysis presents numerous theories, techniques, and methods used for analyzing algorithms. It exposes students to mathematical techniques and methods that are practical and relevant to theoretical aspects of computer science. After introducing basic mathematical and combinatorial methods, the text focuses on various aspects of probability, including finite sets, random variables, distributions, Bayes' theorem, and Chebyshev inequality. It explores the role of recurrences in computer science, numerical analysis, engineering, and discrete mathematics applications. The author then describes the powerful tool of generating functions, which is demonstrated in enumeration problems, such as probabilistic algorithms, compositions and partitions of integers, and shuffling. He also discusses the symbolic method, the principle of inclusion and exclusion, and its applications. The book goes on to show how strings can be manipulated and counted, how the finite state machine and Markov chains can help solve probabilistic and combinatorial problems, how to derive asymptotic results, and how convergence and singularities play leading roles in deducing asymptotic information from generating functions. The final chapter presents the definitions and properties of the mathematical infrastructure needed to accommodate generating functions. Accompanied by more than 1,000 examples and exercises, this comprehensive, classroom-tested text develops students' understanding of the mathematical methodology behind the analysis of algorithms. It emphasizes the important relation between continuous (classical) mathematics and discrete mathematics, which is the basis of computer science.
- Author BiographyVladimir A. Dobrushkin is a professor in the Division of Applied Mathematics at Brown University and a professor in the Department of Computer Science at Worcester Polytechnic Institute.
- Author(s)Vladimir A. Dobrushkin
- PublisherTaylor & Francis Ltd
- Date of Publication05/10/2009
- SubjectComputing: Textbooks & Study Guides
- Series TitleChapman & Hall/CRC Computer & Information Science Series
- Series Part/Volume Numberv. 22
- Country of PublicationUnited States
- ImprintChapman & Hall/CRC
- Content Note54 black & white illustrations, 7 black & white tables
- Weight1610 g
- Width178 mm
- Height254 mm
- Spine41 mm
- Series Edited bySartaj Sahni
- Format DetailsUnsewn / adhesive bound
This item doesn't belong on this page.
Thanks, we'll look into this.