Discrete Mathematics with Combinatorics. This item is unavailable.
Anderson, James A.; Anderson, James; Bell, James
12 ratings by Goodreads
Language: English
Published by Prentice Hall, 2000
- Hardcover
- Used
Seller: Bay State Book Company, North Smithfield, RI, U.S.A.Bay State Book Company
5-star seller
AbeBooks seller since January 23, 2023
Unavailable
Hardcover
Condition: Used - Good
US$ 9.39
Item description from seller
The book is in good condition with all pages and cover intact, including the dust jacket if originally issued. The spine may show light wear. Pages may contain some notes or highlighting, and there might be a "From the library of" label. Boxed set packaging, shrink wrap, or included media like CDs may be missing.
Seller Inventory # BSM.14P12
- Title
- Discrete Mathematics with Combinatorics
- Author
- Anderson, James A.; Anderson, James; Bell, James
- Publisher
- Prentice Hall
- Publication year
- 2000
- Condition
- good
- Binding
- Hardcover
- Language
- English
- ISBN 10
- 0130869988
- ISBN 13
- 9780130869982
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.
"Synopsis" may belong to another edition of this title.
From the Back Cover
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.
"About the title" may belong to another edition of this title.
Search results for Discrete Mathematics with Combinatorics
There are 3 more copies of this bookView all results