Upgradation on progress. Please visit old site at geocities.ws. Sorry for the inconvinence.

BooksHelpful Programming Contest Books

A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory

Miklos Bona
A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory

As the goal of the book is to encourage students to learn more combinatorics, every effort has been made to provide them with a not only useful, but also enjoyable and engaging reading. The problems are a great strength of this text. Each chapter ends with a set of exercises with solutions. These tend to be very interesting and often quite challenging. The best thing I like about this book, is that it has carefully selected subjects and rich set of exercises with detailed solutions. For the first several chapters, there are even more pages devoted to exercises+answers than the text. I think it is better to learn math by doing exercises than memorizing lots of theorems. If looking to improve your combinatorial problem solving or better grasp the scope of the field, It is a perfect solution for you. The selected advanced topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, the theory of designs (new to this edition), enumeration under group action (new to this edition), generating functions of labeled and unlabeled structures and algorithms and complexity with all other chapters.

Purchase Online :   amazon amazon

Concrete Mathematics: A Foundation for Computer Science

Ronald L. Graham, Donald E. Knuth, Oren Patashnik
Concrete Mathematics: A Foundation for Computer Science

The primary aim of its well-known authors is to provide a solid and relevant base of mathematical skills - the skills needed to solve complex problems, to evaluate horrendous sums, and to discover subtle patterns in data. It introduces the mathematics that supports advanced computer programming and the analysis of algorithms. This is one of those books readers would like to keep forever, purely for its utility: it's packed with formulas, techniques, examples. But more than that, the authors lead readers through the techniques and explain the concepts behind them, with the goal of equipping him with the mental tools to attack any mathematical problem to encounter. The authors explain, "it is the controlled manipulation of mathematical formulas, using a collection of techniques for solving problems". Contestant usually find at least one utility of this book in every real time contest room.

Purchase Online :   amazon amazon ebay

Data Structures Using C and C++

Yedidyah Langsam, Moshe J. Augenstein, Aaron M. Tenenbaum
Data Structures Using C and C++

This introduction to the fundamentals of data structures explores abstract concepts, considers how those concepts are useful in problem solving, explains how the abstractions can be made concrete by using a programming language, and shows how to use the C language for advanced programming and how to develop the advanced features of C++. If you are interested in Mastering Trees (Binary Search Tree,Generic Tree & Multiway trees ) & Graphs ,this book could be a very good reference.

Purchase Online :   amazon amazon ebay

Discrete Mathematics and Its Applications

Kenneth Rosen
Discrete Mathematics and Its Applications

This book "Discrete Mathematics and Its Applications" by Kenneth Rosen contain covers everything, very in depth and focus on both the abstract, theoretical as well as the computational and applied. It have lots of worked example, problem and solution at back. It is very good for practice. Due to it focus on applied computational theories it becomes very useful for solving problem in programming contest and 24 hour online judges. Many general reader provide negative feedback for this book. However for contestant, it is a very helpful source of formulas, and practice session.

Purchase Online :  amazon amazonebay

Introduction to Algorithm

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein
Introduction to Algorithm

The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Topics included in this book on algorithms are fastest algorithms, data structures, and polynomial -time algorithms among the few prominent ones. This book can be consider the bible in Algorithm. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. Every detail is clearly explained in this book by Cormen, Leiserson and Rivest so that there is no room for ambiguities. This is a-must-have (+ read) to do good in programming contest.

Purchase Online :  amazon ebayebay

Programming Challenges

Steven S. Skiena, Miguel Revilla
Programming Challenges

The book includes more than 100 programming challenges, as well as the theory and key concepts necessary for approaching them. Problems are organized by topic, and supplemented by complete tutorial material. Readers gain a concrete understanding of both algorithmic techniques and advanced coding topics. It list up a wealth of rich programming problems suitable for self-study and presents practice training for all major programming contests -- ACM International Collegiate Programming Contest (ACM ICPC), International Olympiad in Informatics (IOI), and Topcoder Challenge. This is the first book in the world publish for the programming contestant. It also contain some material that is not only helpful for contestant but also helpful for anyone who want to be a programmer.

Purchase Online :   amazon ebay ebay

The Algorithm Design Manual

Steven S. Skiena
The Algorithm Design Manual

The reader-friendly Algorithm Design Manual provides straightforward access to combinatorial algorithms technology, stressing design over analysis. It serves as the primary textbook of choice for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms. Reader can find tutorial material and exercises online as well as full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video. In addition it have a highly unique catalog of the 75 most important algorithmic problems relating experiences from real-world applications. It is most comprehensive guide to designing practical and efficient algorithms.

Purchase Online :  amazon ebay ebay

The Art of Computer Programming (Vol 1-4A)

Donald E. Knuth
The Art of Computer Programming (Vol 1-4A)

The work that taught many of today’s software developers most of what they know about computer programming are from this book. Bill gates quotes "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". Whatever your background, if you need to do any serious computer programming, you will find your own good reason to make each volume in this series a readily accessible part of your scholarly or professional library. Countless readers have spoken about the profound personal influence of Knuth’s work. Scientists have marveled at the beauty and elegance of his analysis, while ordinary programmers have successfully applied his “cookbook” solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.

Purchase Online :  amazon amazon ebay
Category Problem Categories

Strict Standards: Declaration of link_mod::run() should be compatible with MadhorseModule::run($params = Array, $params2 = '') in /home1/mhrasel/public_html/mhrasel/acmbeginner.org/module/link_mod/module.link_mod.php on line 35