
This is a new edition of a successful introduction to discrete mathematics for computer scientists, updated and reorganised to be more appropriate for the modern day undergraduate audience. Discrete mathematics forms the theoretical basis for computer science and this text combines a rigorous approach to mathematical concepts with strong motivation of these techniques via practical examples.
This text investigates the foundational mathematical principles required for the study and practice of computer science. Author J. K. Truss provides a structured pedagogical framework designed for undergraduate students, bridging the gap between abstract mathematical theory and applied computing. The book utilizes a combination of rigorous proofs and practical examples to demonstrate how discrete structures underpin modern computational logic and algorithm design.
What You Will Find
Experts recognize this work as a standard introductory text for computer science curricula due to its balanced approach between theory and application. Readers frequently note the clarity of the prose, which makes complex mathematical concepts accessible to students without extensive prior experience in formal logic.
Page Count:
688
Publication Date:
1991-01-01
Publisher:
Addison-Wesley
ISBN-10:
0201175649
ISBN-13:
9780201175646
No comments yet. Be the first to share your thoughts!