CART

(0) items

Discrete Mathematical Structures,9780132297516
This item qualifies for
FREE SHIPPING!

FREE SHIPPING OVER $59!

Your order must be $59 or more, you must select US Postal Service Shipping as your shipping preference, and the "Group my items into as few shipments as possible" option when you place your order.

Bulk sales, PO's, Marketplace Items, eBooks, Apparel, and DVDs not included.

Discrete Mathematical Structures

by ; ;
Edition:
6th
ISBN13:

9780132297516

ISBN10:
0132297515
Format:
Hardcover
Pub. Date:
7/14/2008
Publisher(s):
Pearson
Includes 2-weeks free access to
step-by-step solutions for this book.
Step-by-Step solutions are actual worked out problems to the questions at the end of each chapter that help you understand your homework and study for your exams. Chegg and eCampus are providing you two weeks absolutely free. 81% of students said using Step-by-Step solutions prepared them for their exams.
List Price: $169.33

Rent Textbook

(Recommended)
 
Term
Due
Price
$25.00

Hurry!

Only one copy
in stock at this price.

Buy Used Textbook

In Stock Usually Ships in 24 Hours.
U9780132297516
$118.53

Buy New Textbook

Currently Available, Usually Ships in 24-48 Hours
N9780132297516
$161.86

eTextbook


 
Duration
Price
$75.59
More New and Used
from Private Sellers
Starting at $27.00
See Prices

Questions About This Book?

Why should I rent this book?
Renting is easy, fast, and cheap! Renting from eCampus.com can save you hundreds of dollars compared to the cost of new or used books each semester. At the end of the semester, simply ship the book back to us with a free UPS shipping label! No need to worry about selling it back.
How do rental returns work?
Returning books is as easy as possible. As your rental due date approaches, we will email you several courtesy reminders. When you are ready to return, you can print a free UPS shipping label from our website at any time. Then, just return the book to your UPS driver or any staffed UPS location. You can even use the same box we shipped it in!
What version or edition is this?
This is the 6th edition with a publication date of 7/14/2008.
What is included with this book?
  • The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any CDs, lab manuals, study guides, etc.
  • The Used copy of this book is not guaranteed to include any supplemental materials. Typically, only the book itself is included.
  • The Rental copy of this book is not guaranteed to include any supplemental materials. You may receive a brand new copy, but typically, only the book itself.

Related Products


  • Discrete Mathematical Structures
    Discrete Mathematical Structures
  • Discrete Mathematical Structures
    Discrete Mathematical Structures




Summary

Key Message: Discrete Mathematical Structures, Sixth Edition, offers a clear and concise presentation of the fundamental concepts of discrete mathematics. This introductory book contains more genuine computer science applications than any other text in the field, and will be especially helpful for readers interested in computer science. This book is written at an appropriate level for a wide variety of readers, and assumes a college algebra course as the only prerequisite. Key Topics: Fundamentals; Logic; Counting; Relations and Digraphs; Functions; Order Relations and Structures; Trees; Topics in Graph Theory; Semigroups and Groups; Languages and Finite-State Machines; Groups and Coding Market: For all readers interested in discrete mathematics.

Author Biography

Bernard Kolman received his BS in mathematics and physics from Brooklyn College in 1954, his ScM from Brown University in 1956, and his PhD from the University of Pennsylvania in 1965, all in mathematics. He has worked as a mathematician for the US Navy and IBM. He has been a member of the mathematics department at Drexel University since 1964, and has served as Acting Head of the department. His research activities have included Lie algebra and perations research. He belongs to a number of professional associations and is a member of Phi Beta Kappa, Pi Mu Epsilon, and Sigma Xi.

 

Robert C. Busby received his BS in physics from Drexel University in 1963, his AM in 1964 and PhD in 1966, both in mathematics from the University of Pennsylvania. He has served as a faculty member of the mathematics department at Drexel since 1969. He has consulted in applied mathematics and industry and government, including three years as a consultant to the Office of Emergency Preparedness, Executive Office of the President, specializing in applications of mathematics to economic problems. He has written a number of books and research papers on operator algebra, group representations, operator continued fractions, and the applications of probability and statistics to mathematical demography.

 

Sharon Cutler Ross received a SB in mathematics from the Massachusetts Institute of Technology in 1965, an MAT in secondary mathematics from Harvard University in 1966, and a PhD in mathematics from Emory University in 1976. She has taught junior high, high school, and college mathematics, and has taught computer science at the collegiate level. She has been a member of the mathematics department at DeKalb College. Her current professional interests are in undergraduate mathematics education and alternative forms of assessment. Her interests and associations include the Mathematical Association of America, the American Mathematical Association of Two-Year Colleges, and UME Trends. She is a member of Sigma Xi and other organizations.

Table of Contents

Fundamentals
Sets and Subsets
Operations on Sets
Sequences
Properties of Integers
Matrices
Mathematical Structures
Logic
Propositions and Logical Operations
Conditional Statements
Methods of Proof
Mathematical Induction
Mathematical Statements
Logic and Problem Solving
Counting
Permutations
Combinations
Pigeonhole Principle
Elements of Probability
Recurrence Relations 112
Relations and Digraphs
Product Sets and Partitions
Relations and Digraphs
Paths in Relations and Digraphs
Properties of Relations
Equivalence Relations
Data Structures for Relations and Digraphs
Operations on Relations
Transitive Closure and Warshall's Algorithm
Functions
Functions
Functions for Computer Science
Growth of Functions
Permutation Functions
Order Relations and Structures
Partially Ordered Sets
Extremal Elements of Partially Ordered Sets
Lattices
Finite Boolean Algebras
Functions on Boolean Algebras
Circuit Design
Trees
Trees
Labeled Trees
Tree Searching
Undirected Trees
Minimal Spanning Trees
Topics in Graph Theory
Graphs
Euler Paths and Circuits
Hamiltonian Paths and Circuits
Transport Networks
Matching Problems
Coloring Graphs
Semigroups and Groups
Binary Operations Revisited
Semigroups
Products and Quotients of Semigroups
Groups
Products and Quotients of Groups
Other Mathematical Structures
Languages and Finite-State Machines
Languages
Representations of Special Grammars and Languages
Finite-State Machines
Monoids, Machines, and Languages
Machines and Regular Languages
Simplification of Machines
Groups and Coding
Table of Contents provided by Publisher. All Rights Reserved.


Please wait while the item is added to your cart...