x

Our Privacy Policy has changed. By using this site, you agree to the Privacy Policy.

Discrete Mathematics with Ducks

ISBN-10: 1466504994
ISBN-13: 9781466504998
Edition: 2012
Buy it from $75.70
eBook available
This item qualifies for FREE shipping

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

Description: Suitable for an introductory discrete mathematics course, this text covers the subfields of mathematics and computer science that fall under the general umbrella term. It fits the ideas of the basic curriculum as outlined in the SIGCSE guidelines  More...

New Starting from $75.70
eBooks Starting from $30.95
Rent
Buy
what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!
You could win $10,000

Get an entry for every item you buy, rent, or sell.

Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
History of Western Art Online content $4.95 $1.99
Add to cart
Study Briefs
History of World Philosophies Online content $4.95 $1.99
Add to cart
Study Briefs
American History Volume 1 Online content $4.95 $1.99
Add to cart
Study Briefs
History of Western Music Online content $4.95 $1.99

Customers also bought

Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

Copyright year: 2012
Publisher: A K Peters, Limited
Publication date: 6/21/2012
Binding: Hardcover
Pages: 580
Size: 7.75" wide x 9.50" long x 1.25" tall
Weight: 3.014
Language: English

Suitable for an introductory discrete mathematics course, this text covers the subfields of mathematics and computer science that fall under the general umbrella term. It fits the ideas of the basic curriculum as outlined in the SIGCSE guidelines into a framework that focuses on content rather than technique. The book covers standard and practical topics required in discrete math classes. The author also incorporates classroom activities as well as instructor’s notes at the end of every chapter.

The Basics
Counting and Proofs
Introduction and Summary Try This! Let's Count
The Sum and Product Principles
Preliminaries on Proofs and Disproofs
Pigeons and Correspondences
Where to Go from Here
Sets and Logic
Introduction and Summary
Sets
Logic
Try This! Problems on Sets and Logic
Proof Techniques: Not! Try This! A Tricky Conundrum
Where to Go from Here
Bonus: Truth Tellers
Graphs and Functions
Introduction and Summary
Function Introduction Try This! Play with Functions and Graphs
Functions and Counting
Graphs: Definitions and Examples
Isomorphisms
Graphs: Operations and Uses
Try This! More Graph Problems
Ramseyness
Where to Go from Here
Bonus: Party Tricks
Bonus 2 Counting with the Characteristic Function
Induction
Introduction and Summary
Induction Try This! Induction
More Examples
The Best Inducktion Proof Ever Try This! More Problems about Induction
Are They or Aren't They? Resolving Grey Ducks
Where to Go from Here
Bonus: Small Crooks
Bonus 2 An Induction Song
Algorithms with Ciphers
Introduction and Summary
Algorithms
Modular Arithmetic (and Equivalence Relations)
Cryptography: Some Ciphers
Try This! Encryptoequivalent Modulagorithmic Problems
Where to Go from Here
Bonus: Algorithms for Searching Graphs
Bonus 2 Pigeons and Divisibility
Combinatorics
Binomial Coefficients and Pascal's Triangle
Introduction and Summary
You Have a Choice Try This! Investigate a Triangle
Pascal's Triangle
Overcounting Carefully and Reordering at Will
Try This! Play with Powers and Permutations
Binomial Basics
Combinatorial Proof Try This! Pancakes and Proofs
Where to Go from Here
Bonus: Sorting Bubbles in Order of Size
Bonus 2 Mastermind
Balls and Boxes and PIE-Counting Techniques
Introduction and Summary
Combinatorial Problem Types Try This! Let's Have Some PIE
Combinatorial Problem Solutions and Strategies
Let's Explain Our PIE! Try This! What Are the Balls and What Are the Boxes? And Do You Want Some PIE?
Where to Go from Here
Bonus: Linear and Integer Programming
Recurrences
Introduction and Summary
Fibonacci Numbers and Identities
Recurrences and Integer Sequences and Induction Try This! Sequences and Fibonacci Identities
Naive Techniques for Finding Closed Forms and Recurrences
Arithmetic Sequences and Finite Differences
Try This! Recurrence Exercises
Geometric Sequences and the Characteristic Equation Try This! Find Closed Forms for These Recurrence Relations!
Where to Go from Here
Bonus: Recurring Stories
Cutting up Food (Counting and Geometry)
Introduction and Summary
Try This! Slice Pizza (and a Yam)
Pizza Numbers Try This! Spaghetti, Yams, and More
Yam, Spaghetti and Pizza Numbers
Where to Go from Here
Bonus: Geometric Gems
Graph Theory
Trees
Introduction and Summary
Basic Facts about Trees Try This! Spanning Trees
Spanning Tree Algorithms
Binary Trees Try This! Binary Trees and Matchings
Matchings
Backtracking
Where to Go from Here
Bonus: The Branch-and-Bound Technique in Integer Programming
Euler's Formula and Applications
Introduction and Summary Try This! Planarity Explorations
Planarity
A Lovely Story
Or, Are Emus Full?: A Theorem and a Proof
Applications of Euler's Formula
Try This! Applications of Euler's Formula
Where to Go from Here
Bonus: Topological Graph Theory
Graph Traversals
Introduction and Summary Try This! Euler Traversals
Euler Paths and Circuits
Hamilton Circuits, the Traveling Salesperson Problem, and Dijkstra's Algorithm Try This!-Do This!-Try This!
Where to Go from Here
Bonus: Digraphs, Euler Traversals, and RNA Chains
Bonus 2 Network Flows
Bonus 3 Two Hamiltonian Theorems
Graph Coloring
Introduction and Summary Try This! Coloring Vertices and Edges
Introduction to Coloring
Try This! Let's Think about Coloring
Coloring and Things (Graphs and Concepts) That Have Come Before
Where to Go from Here
Bonus: The Four-Color Theorem
Other Material
Probability and Expectation
Introduction and Summary
What Is Probability, Exactly?
High Expectations
You are Probably Expected to Try This!
Conditional Probability and Independence
Try This! . . . Probably, Under Certain Conditions
Higher Expectations
Where to Go from Here
Bonus: Ramsey Numbers and the Probabilistic Method
Fun with Cardinality
Introduction and Summary
Read This! Parasitology, The Play
How Big Is Infinite? Try This! Investigating the Play
How High Can We Count?
Where to Go from Here
Bonus: The Schr�der-Bernstein Theorem
Additional Problems
Solutions to Check Yourself Problems
The Greek Alphabet and Some Uses for Some Letters
List of Symbols
Glossary
Bibliography
Problems and Instructor Notes appear at the end of each chapter

×
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×