Printer Friendly

Lectures on discrete mathematics for computer science.


Lectures on discrete mathematics for computer science.

Khoussainov, Bakhadyr and Nodira Khoussainova.

World Scientific


346 pages



Algebra and discrete mathematics; v.3


Intended for a single-semester course in discrete mathematics, this text contains 33 chapters, each covering approximately a 50-minute lecture. The text is distinguished by the authors' emphasis on induction as an essential method for reasoning about algorithms, programs, and the objects defined by them; analysis of at least one algorithm in every chapter; and comprehensive coverage of finite automata. Bakhadyr Khoussainvov (U. of Auckland, New Zealand) is a well-established mathematician, and Nodira Khoussainova (U. of Washington) is a young computer science PhD candidate. Together they offer a combination of rigorous definitions and proofs as well as informal explanations with examples. Problems and programming exercises conclude each chapter.

([c] Book News, Inc., Portland, OR)

COPYRIGHT 2013 Book News, Inc.
No portion of this article can be reproduced without the express written permission from the copyright holder.
Copyright 2013 Gale, Cengage Learning. All rights reserved.

Article Details
Printer friendly Cite/link Email Feedback
Publication:Reference & Research Book News
Article Type:Brief article
Date:Apr 1, 2013
Previous Article:A practical approach to large-scale Agile development; how HP transformed laserjet futuresmart firmware.
Next Article:Geometric realizations of curvature.

Terms of use | Privacy policy | Copyright © 2020 Farlex, Inc. | Feedback | For webmasters