Discrete Mathematics

ISBN-10: 0201883368
ISBN-13: 9780201883367
Edition: 2000
List price: $117.80
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: Discrete Mathematics, by Washburn, Marlowe, and Ryan, is now available for your students. This new textbook excels at integrating the topics that make up a discrete mathematics course, creating a cohesive presentation for your students. Discrete  More...

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
Careers in Legal Assisting Online content $4.95 $1.99
Add to cart
Study Briefs
Italian Grammar Online content $4.95 $1.99
Add to cart
Study Briefs
Portuguese Grammar Online content $4.95 $1.99
Add to cart
Study Briefs
Spanish Grammar Online content $4.95 $1.99

Customers also bought

Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $117.80
Copyright year: 2000
Publisher: Addison Wesley
Publication date: 8/26/1999
Binding: Paperback
Pages: 640
Size: 8.00" wide x 9.50" long x 0.75" tall
Weight: 2.046

Discrete Mathematics, by Washburn, Marlowe, and Ryan, is now available for your students. This new textbook excels at integrating the topics that make up a discrete mathematics course, creating a cohesive presentation for your students. Discrete Mathematics combines classic, historical material and cutting-edge computer science applications in a clear, high-quality format. The exercise sets, including basic exercises, advanced exercises, and computer exercises, are designed to allow your students to master what they have learned before moving on to more difficult material. With its highly flexible organization, and unique grade of difficulty, Discrete Mathematics successfully fits either the freshman-sophomore course or a more advanced junior-senior course, and is accessible to both computer scientists and mathematicians.

Sets, Subsets, Induction and Recursion
The Pascal Triangle (Application: A Counting Problem)
Induction (Application: The Tower of Hanoi)
Sets, Subsets, and Binary Strings (Application: The Knapsack Problem)
Set Operations (Application: An Error-Correcting Code)
Recursions (Application: Shift Registers)
Integers, Remainders, and the Golden Ratio
The Integers (Application: When is Div(n)a Tree?)
Lam�'s Theorem (Application: Egyptian Fractions)
The Integers Modn(Application: Public Key Encryption)
Functions, Relations, and Counting
Functions and Relations (Application: The Pr�fer Correspondence)
Counting Rules (Application: Boolean Functions)
Three Counting Techniques (Application: Tenth Powers)
Graphs
Graphs (Application: The Icosahedron and Dodecahedron)
Graph Theory (Application: One-Way Streets)
Trees (Application: Structural Induction)
Proof Techniques and Logic
Proof Techniques (Application: The Liar Problem)
Logic (Application: Logic and the Genetic Code)
The Propositional Calculus (Application: Syllogisms)
Boolean Algebras, Boolean Functions, and Logic
Boolean Algebras and Functions (Application: Normal Forms in the Propositional Calculus)
Boolean Functions and Circuits (Application: Regions in Logic Diagrams)
The Predicate Calculus (Application: Proving Program Correctness)
Graphs and Relations
Graph Coloring and Matching (Application: Register Allocation)
Posets and Lattices (Application: The Kirkman Schoolgirl Problem)
Algorithms
Sorting, Searching, and Listing (Application: The Man, Dog, Goat, and Cabbage Problem)
Graph Algorithms (Application: Network Flows)
The Complexity of an Algorithm (Application: Kruskal's Algorithm and Prim's Algorithm)
Combinatorics
Recursions and Their Solution (Application: AVL trees)
Probabilities (Application: Network Reliability)
Groups and Counting (Application: Rooted Trees)
Models of Computation
Languages and Grammars (Application: The Chomsky Heirarchy)
Finite State Machines and Turing Machines (Application: DNA Computing)
G�del and Turing (Application: The Vanishing)
Appendices
Guide to the Literature
Notes
Answers to Selected Exercises
Index

×
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.

×