Discrete Mathematics and Its Applications

Name: Discrete Mathematics and Its Applications
Price: 4.91 USD
Availability: InStock
ISBN: 9780073107790

ISBN-10: 0073107794

ISBN-13: 9780073107790

Edition: 6th 2007 (Student Manual, Study Guide, etc.)

Authors: Kenneth H. Rosen, Jerrold W. Grossman

List price: $87.00

30 day, 100% satisfaction guarantee!

Marketplace

4 new & used from $4.91

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

Description:

FULL TITLE: Student's Solutions Guide to Accompany Discrete Mathematics and Its Applications

Book details

List price: $87.00
Edition: 6th
Copyright year: 2007
Publisher: McGraw-Hill Higher Education
Publication date: 7/27/2006
Binding: Paperback
Pages: 528
Size: 8.50" wide x 10.75" long x 0.75" tall
Weight: 2.354
Language: English

Kenneth H. Rosen is a Distinguished Member of the Technical Staff at AT&T Laboratories in Middletown, New Jersey. His current assignment involves the assessment of new technology and the creation of new services for AT&T. Dr. Rosen has written several leading textbooks and many articles. Rosen received his Ph.D. from MIT.



Discrete Mathematics and Its Applications, Fifth Edition



The Foundations: Logic and Proof, Sets, and Functions



Logic



Propositional Equivalences



Predicates and Quantifiers



Nested Quantifiers



Methods of Proof



Sets



Set Operations



Functions



The Fundamentals: Algorithms, the Integers, and Matrices



Algorithms



The Growth of Functions



Complexity of Algorithms



The Integers and Division



Applications of Number Theory



Matrices



Mathematical Reasoning, Induction, and Recursion



Proof Strategy



Sequences and Summations



Mathematical Induction



Recursive Definitions and Structural Induction



Recursive Algorithms



Program Correctness



Counting



The Basics of Counting



The Pigeonhole Principle



Permutations and Combinations



Binomial Coefficients



Generalized Permutations and Combinations



Generating Permutations and Combinations



Discrete Probability



An Introduction to Discrete Probability



Probability Theory



Expected Value and Variance



Advanced Counting Techniques



Recurrence Relations



Solving Recurrence Relations



Divide-and-Conquer Algorithms and Recurrence Relations



Generating Functions



Inclusion-Exclusion



Applications of Inclusion-Exclusion



Relations



Relations and Their Properties



n-ary Relations and Their Applications



Representing Relations



Closures of Relations



Equivalence Relations



Partial Orderings



Graphs



Introduction to Graphs



Graph Terminology



Representing Graphs and Graph Isomorphism



Connectivity



Euler and Hamilton Paths



Shortest-Path Problems



Planar Graphs



Graph Coloring



Trees



Introduction to Trees



Applications of Trees



Tree Traversal



Spanning Trees



Minimum Spanning Trees



Boolean Algebra



Boolean Functions



Representing Boolean Functions



Logic Gates



Minimization of Circuits



Modeling Computation



Languages and Grammars



Finite-State Machines with Output



Finite-State Machines with No Output



Language Recognition



Turing Machines


Appendixes



Exponential and Logarithmic Functions



Pseudocode