Discrete Mathematics: 5th Edition

Author: [USA] Johnsonbaugh
Publisher:
Publish Date: 2003-09-01
Features: This book introduces discrete mathematics from the perspectives of algorithms and problem-solving. The entire book is divided into 11 chapters, covering topics such as logic and proofs, sets, relations, and functions, algorithms, permutations and combinations, the pigeonhole principle, classical probability, recurrence relations, basic concepts of graphs, trees and their applications, network models, Boolean algebra and combinational circuits, automata, grammars, and languages, computational geometry, etc. Each chapter includes key points, chapter summaries, chapter tests, and computer exercises. The book features 500 carefully selected examples, 3,500 practice problems, and 135 computer exercises, which greatly assist readers in learning, understanding, and applying discrete mathematics theory. This book is suitable as a textbook for discrete mathematics courses in computer-related disciplines at universities and colleges, as well as for self-study by readers.