Discrete Mathematics and Its Applications

Name: Discrete Mathematics and Its Applications
Price: 5.52 USD
Availability: InStock
ISBN: 9780072474770

ISBN-10: 0072474777

ISBN-13: 9780072474770

Edition: 5th 2003

Authors: Kenneth H. Rosen

List price: $33.75

30 day, 100% satisfaction guarantee!

Marketplace

3 new & used from $5.52

what's this?

Rush Rewards U
Members Receive:

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

Book details

List price: $33.75
Edition: 5th
Copyright year: 2003
Publisher: Glencoe/McGraw-Hill
Binding: Paperback
Size: 8.50" wide x 10.50" long x 1.00" tall
Weight: 2.596
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