This title covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. 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.

Suitable for one- or two-term introductory discrete mathematics courses taken by students from a variety of majors. This text gives an introduction to the primary themes in a discrete mathematics course and demonstrates the relevance and practicality of discrete mathematics to a variety of real-world applications.

A text on computational theory. It provides a mathematical treatment of computer science theory designed around theorems and proofs.

The challenges of problems from international programming competitions are an effective way to improve algorithmic and coding skills and understanding. This book uses international programming competition-type problems to motivate the study of algorithms, programming, and other topics in computer science.

Alan Turing who has been described as the father of the modern computer. He was continually frustrated in his desire to build a machine which could think, as those with power over him feared both his homosexuality and indiscretion. This is an account of his life, which ended by his own hand.

This classic book on formal languages, automata theory, and computational complexity has been updated to present theoretical concepts in a concise and straightforward manner with the increase of hands-on, practical applications. This new edition comes with Gradiance, an online assessment tool developed for computer science. Gradiance is the most advanced online assessment tool developed for the ..