Discrete Structures with Contemporary Applications
Discrete Structures with Contemporary Applications
Click to enlarge
Author(s): Stanoyevitch, Alexander
ISBN No.: 9781439817681
Pages: 1,002
Year: 201101
Format: Trade Cloth (Hard Cover)
Price: $ 169.34
Dispatch delay: Dispatched between 7 to 15 days
Status: Available (On Demand)

Logic and Sets Logical Operators Logical Quantifiers Sets Relations and Functions, Boolean Algebra, and Circuit Design Relations and Functions Equivalence Relations and Partial Orderings Boolean Algebra and Circuit Design The Integers, Induction, and Recursion Mathematical Induction Recursion Some Topics in Elementary Number Theory Number Systems Representations of Integers in Different Bases Modular Arithmetic and Congruences Matrices Floating Point Arithmetic Public Key Cryptography Counting Techniques, Combinatorics, and Generating Functions Fundamental Principles of Counting Permutations, Combinations, and the Binomial Theorem Generating Functions Discrete Probability and Simulation Introduction to Discrete Probability Random Numbers, Random Variables, and Basic Simulations Complexity of Algorithms Some Algorithms for Searching and Sorting Growth Rates of Functions and the Complexity of Algorithms Graphs, Trees, and Associated Algorithms Graph Concepts and Properties Paths Connectedness, and Distances in Graphs Trees Graph Traversal and Optimization Problems Graph Traversal Problems Tree Growing and Graph Optimization Algorithms Network Flows Randomized Search and Optimization Algorithms Randomized Search and Optimization: An Overview Genetic Algorithms Appendix A: Pseudo Code Dictionary Appendix B: Solutions to all Exercises for the Reader Appendix C: Answers/Brief Solutions to Odd Numbered Exercises References Index TRONG>Fundamental Principles of Counting Permutations, Combinations, and the Binomial Theorem Generating Functions Discrete Probability and Simulation Introduction to Discrete Probability Random Numbers, Random Variables, and Basic Simulations Complexity of Algorithms Some Algorithms for Searching and Sorting Growth Rates of Functions and the Complexity of Algorithms Graphs, Trees, and Associated Algorithms Graph Concepts and Properties Paths Connectedness, and Distances in Graphs Trees Graph Traversal and Optimization Problems Graph Traversal Problems Tree Growing and Graph Optimization Algorithms Network Flows Randomized Search and Optimization Algorithms Randomized Search and Optimization: An Overview Genetic Algorithms Appendix A: Pseudo Code Dictionary Appendix B: Solutions to all Exercises for the Reader Appendix C: Answers/Brief Solutions to Odd Numbered Exercises References Index lows Randomized Search and Optimization Algorithms Randomized Search and Optimization: An Overview Genetic Algorithms Appendix A: Pseudo Code Dictionary Appendix B: Solutions to all Exercises for the Reader Appendix C: Answers/Brief Solutions to Odd Numbered Exercises References Index.


To be able to view the table of contents for this publication then please subscribe by clicking the button below...
To be able to view the full description for this publication then please subscribe by clicking the button below...