Ship-Ship-Hooray! Free Shipping on $25+ Details >
Discrete Mathematical Structures

Discrete Mathematical Structures - 6th edition

Discrete Mathematical Structures - 6th edition

ISBN13: 9780132297516

ISBN10: 0132297515

Discrete Mathematical Structures by Bernard Kolman - ISBN 9780132297516
Cover type: Hardback
Edition: 6TH 09
Copyright: 2009
Publisher: Prentice Hall, Inc.
Published: 2009
International: No
Discrete Mathematical Structures by Bernard Kolman - ISBN 9780132297516

ISBN13: 9780132297516

ISBN10: 0132297515

Cover type: Hardback
Edition: 6TH 09

List price: $194.00

Instant access, flexible term options, and deep discounts up to 60% on digital content! Happy you, happy us.

Delivered via email within 1 hour
Use for 180 days
You Save $155.01 (80%)
Format: Digital

Please note: eTextbooks do not come with access codes, CDs/DVDs, workbooks, and other supplemental items.
Well, that's no good. Unfortunately, this edition is currently out of stock. Please check back soon.


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.

Table of Contents

Table of Contents

1. Fundamentals 1.1 Sets and Subsets 1.2 Operations on Sets 1.3 Sequences 1.4 Properties of Integers 1.5 Matrices 1.6 Mathematical Structures

2. Logic 2.1 Propositions and Logical Operations 2.2 Conditional Statements 2.3 Methods of Proof 2.4 Mathematical Induction 2.5 Mathematical Statements 2.6 Logic and Problem Solving

3. Counting 3.1 Permutations 3.2 Combinations 3.3 Pigeonhole Principle 3.4 Elements of Probability 3.5 Recurrence Relations 112

4. Relations and Digraphs 4.1 Product Sets and Partitions 4.2 Relations and Digraphs 4.3 Paths in Relations and Digraphs 4.4 Properties of Relations 4.5 Equivalence Relations 4.6 Data Structures for Relations and Digraphs 4.7 Operations on Relations 4.8 Transitive Closure and Warshall's Algorithm

5. Functions 5.1 Functions 5.2 Functions for Computer Science 5.3 Growth of Functions 5.4 Permutation Functions

6. Order Relations and Structures 6.1 Partially Ordered Sets 6.2 Extremal Elements of Partially Ordered Sets 6.3 Lattices 6.4 Finite Boolean Algebras 6.5 Functions on Boolean Algebras 6.6 Circuit Design 7. Trees 7.1 Trees 7.2 Labeled Trees 7.3 Tree Searching 7.4 Undirected Trees 7.5 Minimal Spanning Trees

8. Topics in Graph Theory 8.1 Graphs 8.2 Euler Paths and Circuits 8.3 Hamiltonian Paths and Circuits 8.4 Transport Networks 8.5 Matching Problems 8.6 Coloring Graphs

9. Semigroups and Groups 9.1 Binary Operations Revisited 9.2 Semigroups 9.3 Products and Quotients of Semigroups 9.4 Groups 9.5 Products and Quotients of Groups 9.6 Other Mathematical Structures

10. Languages and Finite-State Machines 10.1 Languages 10.2 Representations of Special Grammars and Languages 10.3 Finite-State Machines 10.4 Monoids Machines and Languages 10.5 Machines and Regular Languages 10.6 Simplification of Machines 11. Groups and Coding

Digital Rights

eBook Requirements
VitalSource Bookshelf Reader
Minimum System Requirements:
  • Windows 7/8, or Mac OS X 10.6 or above
Software Requirements:

eTextbooks and eChapters can be viewed by using the free reader listed below.

Be sure to check the format of the eTextbook/eChapter you purchase to know which reader you will need. After purchasing your eTextbook or eChapter, you will be emailed instructions on where and how to download your free reader.

Download Requirements:

Due to the size of eTextbooks, a high-speed Internet connection (cable modem, DSL, LAN) is required for download stability and speed. Your connection can be wired or wireless.

Being online is not required for reading an eTextbook after successfully downloading it. You must only be connected to the Internet during the download process.

User Help:

Click Here to access the VitalSource Bookshelf FAQ

Digital Rights
VitalSource Bookshelf
Copying: Allowed, 2 selections may be copied every 180 days
Printing: Allowed, 2 prints for 180 days
Expires: Yes, may be used for 180 days after activation
Reading Aloud: Allowed
Sharing: Not Allowed
Min. Software Version: VitalSource Bookshelf
Suitable Devices: PCs, Tablet PCs, Macs, Laptops

Digital Rights Management (DRM) Key

Copying - Books that cannot be copied will show "Not Allowed." Otherwise, this will detail the number of times it can be copied, or "Allowed with no limits."

Printing - Books that cannot be printed will show "Not Allowed." Otherwise, this will detail the number of times it can be printed, or "Allowed with no limits."

Expires - Books that have no expiration (the date upon which you will no longer be able to access your eBook) will read "No Expiration." Otherwise it will state the number of days from activation (the first time you actually read it).

Reading Aloud - Books enabled with the "text-to-speech" feature so that they can be read aloud will show "Allowed."

Sharing - Books that cannot be shared with other computers will show "Not Allowed."

Min. Software Version - This is the minimum software version needed to read this book.

Suitable Devices - Hardware known to be compatible with this book. Note: Reader software still needs to be installed.

Top Arrow