Solutions manual available upon qualifying course adoption.
Reflecting many of the recent advances and trends in this area, Discrete Structures with Contemporary Applications covers the core topics in discrete structures as well as an assortment of novel applications-oriented topics. The applications described include simulations, genetic algorithms, network flows, probabilistic primality tests, public key cryptography, and coding theory.
A modern and comprehensive introduction to discrete structures
With clear definitions and theorems and carefully explained proofs, this classroom-tested text presents an accessible yet rigorous treatment of the material. Numerous worked-out examples illustrate key points while figures and tables help students grasp the more subtle and difficult concepts. "Exercises for the Reader" are interspersed throughout the text, with complete solutions included in an appendix. In addition to these, each section ends with extensive, carefully crafted exercise sets ranging from routine to nontrivial; answers can be found in another appendix. Most sections also contain computer exercises that guide students through the process of writing their own programs on any computing platform.
Accommodates various levels of computer implementation
Although the book highly encourages the use of computing platforms, it can be used without computers. The author explains algorithms in ordinary English and, when appropriate, in a natural and easy-to-understand pseudo code that can be readily translated into any computer language. A supporting website provides an extensive set of sample programs.
Logic and Sets
Relations and Functions, Boolean Algebra, and Circuit Design
The Integers, Induction, and Recursion
Counting Techniques, Combinatorics, and Generating Functions
Discrete Probability and Simulation
Complexity of Algorithms
Graphs, Trees, and Associated Algorithms
Graph Traversal and Optimization Problems
Graph Traversal Problems
Tree Growing and Graph Optimization Algorithms
Randomized Search and Optimization Algorithms
Randomized Search and Optimization: An Overview
Appendix A: Pseudo Code Dictionary
Appendix B: Solutions to all Exercises for the Reader
Appendix C: Answers/Brief Solutions to Odd Numbered Exercises
Alexander Stanoyevitch is a professor at California State University–Dominguez Hills. He completed his doctorate in mathematical analysis at the University of Michigan, Ann Arbor, and has held academic positions at the University of Hawaii and the University of Guam. Dr. Stanoyevitch has taught many upper-level classes to mathematics and computer science students, has published several articles in leading mathematical journals, and has been an invited speaker at numerous lectures and conferences in the United States, Europe, and Asia. His research interests include areas of both pure and applied mathematics.
…this is the most physically readable textbook that I have seen in a long time. The print is clear and large … The text is readable, there are many examples and in many cases proofs of the theorems are included. A large number of exercises are provided and split into two categories, the traditional math problem and exercises to be performed on a computer. … The two most important courses in the computer science major are the first programming and discrete math classes. Each establishes a foundation of skills that will be repeatedly used throughout the major field of study and this book is an excellent text for the development of the needed skills in math.
—Charles Ashbacher, MAA Reviews, March 2011
|Platform type||December 20, 2010||Author site||click on http://www.csudh.edu/math/astanoyevitch/discrete.html|
CRC Press eBooks are available through VitalSource. The free VitalSource Bookshelf® application allows you to access to your eBooks whenever and wherever you choose.The Bookshelf application offers access: