Friendly writing style make this text ideal for sophomore/junior level students.
This approachable text studies discrete objects and the relationships that bind them. It helps students understand and apply the power of discrete math to digital computer systems and other modern applications. It provides excellent preparation for courses in linear algebra, number theory, and modern/abstract algebra and for computer science courses in data structures, algorithms, programming languages, compilers, databases, and computation. It covers all recommended topics in a self-contained, comprehensive, and understandable format for students and new professionals. It emphasizes problem-solving techniques, pattern recognition, conjecturing, induction, applications of varying nature, proof techniques, algorithm development and correctness, and numeric computations. It weaves numerous applications into the text. It helps students learn by doing with a wealth of examples and exercises: 560 examples worked out in detail; more than 3,700 exercises; more than 150 computer assignments; and more than 600 writing projects. It includes chapter summaries of important vocabulary, formulas, and properties, plus the chapter review exercises.It features interesting anecdotes and biographies of 60 mathematicians and computer scientists. This is the Instructor's Manual available for adopters. Student Solutions Manual is available separately for purchase (ISBN: 0124211828).
PrefaceLanguage of Sets; 3. Functions and Matrices; 4. Induction and Algorithms; 5. Recursion; 6. Combinatorics and Discrete Probability; 7. Relations; 8. Graphs; 9. Trees; 10. Digraphs; 11. Formal Languages and Finite-State Machines; 12. Boolean Algebra and Combinatorial Circuits; Appendix; Bibliography; Solutions to Odd Numbered Exercises; Index.