Essentials of Discrete Mathematics (The Jones & Bartlett Learning Inernational Series in Mathematics)

Essentials of Discrete Mathematics, Second Edition is the ideal text for a one-term discrete mathematics course to serve computer science majors as well as students from a wide range of other disciplines. It introduces students to the mathematical way of thinking, and also to many important modern applications. The material is organized around five types of thinking: logical, relational, recursive, quantitative, and analytical. This presentation results in a coherent outline that steadily builds upon mathematical sophistication. Graphs are introduced early and referred to throughout the text, providing a richer context for examples and applications. Students will encounter algorithms near the end of the text, after they have acquired the skills and experience needed to analyze them. The final chapter contains in-depth case studies from a variety of fields, including biology, sociology, linguistics, economics, and music. Clear and concise, Essentials of Discrete Mathematics presents a unified and complete picture of discrete mathematics that instructors can cover in a single semester.

• Book of Proof
• Introduction to Algorithms, 3rd Edition (The MIT Press)
• Computer Organization and Design: The Hardware/Software Interface (The Morgan Kaufmann Series in Computer Architecture and Design)
• C Programming Language, 2nd Edition
• The Algorithm Design Manual
• Cracking the Coding Interview: 189 Programming Questions and Solutions
• hapi.js in Action
• Applied Combinatorics
• BECOMING A TECHNICAL PROFESSIONAL - TEXT
• Databases Illuminated