Discrete Mathematics with Combinatorics (2nd Edition) | 
 enlarge | Author: James A. Anderson
Publisher: Prentice Hall
Category: Book
List Price: $122.20
Buy New: $27.50
You Save: $94.70 (77%)
New (7) Used (14) from $24.49
Rating:  2 reviews
Sales Rank: 294577
Media: Hardcover
Edition: 2
Pages: 928
Number Of Items: 1
Shipping Weight (lbs): 4.2
Dimensions (in): 10.1 x 8.3 x 1.3
ISBN: 0130457914
Dewey Decimal Number: 510
EAN: 9780130457912
Publication Date: August 29, 2003
Availability: Usually ships in 1-2 business days
Shipping: Expedited shipping available
Condition: All orders receive tracking information upon shipment (except expedited PO boxes). May not contain certain online supplements such as infotrac and web access codes. Used items likely contain highlighting and/or writing. Expedited shipping available.
| |
| Similar Items:
|
| Editorial Reviews:
Product Description
This carefully organized, very readable book covers every essential topic in discrete mathematics in a logical fashion. Placing each topic in context, it covers concepts associated with discrete mathematical systems that have applications in computer science, engineering, and mathematics. The author introduces more basic concepts at the freshman level than are found in other books, in a simple, accessible form. Introductory material is balanced with extensive coverage of graphs, trees, recursion, algebra, theory of computing, and combinatorics. Extensive examples throughout the text reinforce concepts. More combinatorics/algebraic structures than in most books. Detailed discussion of and strong emphasis on proofs. Extensive, in-depth presentation of topics. Large selection of applied and computational problems, ranging from the elementary to the more advanced. More topics in probability and more statistical interpretations than other texts. Comprehensive discussion of topics such as finite state machines, automata, and languages. Earlier introduction of matrices and relations, Boolean algebras and circuits than most texts. Includes algorithms for many constructive tasks that occur in discrete systems.
|
| Customer Reviews:
 It is high on my list of potential textbooks for a course in discrete math July 29, 2008
Charles Ashbacher (Marion, Iowa United States(cashbacher@yahoo.com))
1 out of 1 found this review helpful
I occasionally teach discrete mathematics at the college level and so I am always trolling in a search for a better textbook. That is the context within which I examined this book. The coverage of the basic topics is exactly the way I prefer in both order and content. The initial chapters are:
*) Truth tables, logic and proofs
*) Set theory
*) Logic, integers and proofs
*) Functions and matrices
I would never use a book that did not cover logic, set theory, relations and functions in that order.
The remaining topics in the order they appear are:
*) Algorithms and recursion
*) Graphs, directed graphs and trees
*) Number theory
*) Counting and probability
*) Algebraic structures
*) Number theory revisited
*) Recursion revisited
*) Counting continued
*) Generating functions
*) Graphs revisited
*) Trees
*) Networks
*) Theory of computation
*) Theory of codes
*) Enumeration of colors
*) Rings, integral domains and fields
*) Group and semigroup characters
*) Applications of number theory
As can be seen from this list, there is much more material here than can be covered in a one-semester course. However, the sections are independent enough that selection can be done. For example, the "revisited" chapters could be skipped. This revisiting means that the depth of coverage is there if you have need of it. A large number of exercises are included at the end of the chapters and solutions to many of them are included.
I do not know if and when I will teach discrete math again. If that situation does arise again, I will give this book strong consideration as the choice of text.
 A pretty good book November 10, 2000
2 out of 5 found this review helpful
While the table of contents is very good, too much time is wasted in developing preliminaries. The text should quickly move into the core of the subject, but instead spends 220 pages developing the elementary material. A good reference for teachers of discrete mathematics with emphasis in combinatorics and not in computer science.
|
|
|
