
Equally well-suited to programmers and non-programmers alike, this book presents the topics of discrete mathematics with an emphasis on applications, problem-solving, and algorithms. The interplay between mathematics and computer science is the primary theme of the book. The book emphasizes development of relevant mathematical techniques, and motivates these techniques through numerous examples, applications, and exercises. Over 1,300 graded exercises, from routine to challenging, provide ample drill for students and enhance their understanding of concepts, algorithms, and proofs.
This text investigates the foundational principles of discrete mathematics and their practical application within the field of computer science. Kenneth Kalmanson provides a structured approach to mathematical techniques, focusing on the symbiotic relationship between logical theory and algorithmic implementation. The book utilizes a pedagogical framework that prioritizes problem-solving skills and the development of computational thinking through rigorous practice.
What You Will Find
Experts and educators frequently cite this text as a reliable resource for students transitioning into computer science coursework. Readers often note the clarity of the examples and the effectiveness of the exercise sets in reinforcing complex mathematical concepts.
Page Count:
486
Publication Date:
1986-01-01
Publisher:
Addison-Wesley
ISBN-10:
0201149478
ISBN-13:
9780201149470
No comments yet. Be the first to share your thoughts!