Discrete mathematics : a first course /
Alexander Stanoyevitch
- Los Angeles California : Contemporary Scientific Press, c2021.
- xviii, 570 pages illustrations ; 25 cm.
Includes index.
Preface -- Chapter 1: Chapter 1: Logical Operators -- Chapter 2: Logical Quantifiers -- Chapter 3: Sets -- Chapter 4: Relations and Functions -- Chapter 5: Equivalence Relations and Partial Orderings -- Chapter 6: Mathematical Induction -- Chapter 7: Recursion -- Chapter 8: Some Number Theory -- Chapter 9: Representations of Integers in Different Bases -- Chapter 10: Modular Arithmetic and Congruences -- Chapter 11: Fundamental Principles of Counting -- Chapter 12: Permutations and Combinations -- Chapter 13: Searching and Sorting Algorithms -- Chapter 14: Growth Rates of Functions and Complexity of Algorithms -- Chapter 15: Graph Concepts and Properties -- Chapter 16: Paths, Connectedness, and Distances in Graphs -- Chapter 17: Trees -- Chapter 18: Graph Traversal Problems -- Appendix A: Pseudo Code Dictionary -- Appendix B: Randomness and Probability -- Appendix C: Answers and Solutions to Most Odd-Numbered Exercise -- References -- Index of Algorithms.
' This textbook has been created to provide an introduction to the important concepts in discrete mathematics that are needed for students who are studying either mathematics or computer science. Material from the authors larger book on the subject has been carefully selected, thoroughly revised, and put together in a way that is intended to make it readable and enticing to students. Many more worked-examples have been added throughout each chapter. Feedback from students and others who have used the earlier book has been used to provide more careful explanations in areas that students usually find difficult. ''