Author:
James A. Anderson

ISBN 13:
9780130457912

ISBN 10:
130457914

Edition:
2

Publisher:
Prentice Hall

Publication Date:
2003-08-29

Format:
Hardcover

Pages:
928

List Price:
$122.20

For the second edition of this text for freshman and sophomore mathematics and computer science majors, Anderson (University of South Carolina) has added more coverage on proofs, especially in the first chapter, and more problems that involve proofs, plus more material on computer science applications and matrices, and coverage of finite states with output and Turing machines. True-false questions, summary questions, and a glossary are now included at the end of each chapter in this edition. Coverage includes logic, set theory, algorithms, graph theory, trees, combinatorics, and algebra. The text is intended for a one- or two-term course in discrete mathematics, and assumes only college algebra as background. Annotation © 2004 Book News, Inc., Portland, OR

Anderson (University of South Carolina) emphasizes the development of proofs in this textbook for a two-term course in discrete mathematics. The first eight chapters can be used for a first-level course that covers logic, set theory, algorithms, trees, and number theory. The remaining 14 chapters include groups, lattices, combinatorics, finite differences, graph theory, and networks. Annotation c. Book News, Inc., Portland, OR (booknews.com)