Essentials of discrete mathematics / David J. Hunter.
Material type:
TextPublication details: Burlington, MA : Jones & Bartlett Learning, ©2017.Edition: Third editionDescription: xvi, 492 pages : illustrations (some color) ; 24 cmISBN: - 9781284056242
- 004.015113 23 H945
| Item type | Current library | Call number | Status | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|
| Books | ISI Library, Kolkata | 004.015113 H945 (Browse shelf(Opens below)) | Available | 137974 |
Browsing ISI Library, Kolkata shelves Close shelf browser (Hides shelf browser)
| 004.0151 Y24 Quantum computational number theory / | 004.015113 C133 Introduction to fuzzy reliability | 004.015113 H487 Complexity theory retrospective II | 004.015113 H945 Essentials of discrete mathematics / | 004.015113 N534 Automated theorem proving | 004.015113 N534 Automated theorem proving | 004.01513 F648 Advanced computer arithmetic design |
Includes bibliographical references and indexes.
1. Logical thinking --
2. Relational thinking --
3. Recursive thinking --
4. Quantitative thinking --
5. Analytical thinking --
6. Thinking through applications.
This third edition is designed to serve computer science and mathematics majors, as well as students from a wide range of other disciplines. The mathematical 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. Algorithms are presented near the end of the text, after students have acquired the skills and experience needed to analyze them. The final chapter emphasizes the multidisciplinary approach and contains case studies that integrate the fields of biology, sociology, linguistics, economics, and music. New & Key Features: NEW - Student Inquiry Problems, found at the beginning of each section, are designed to introduce and motivate the material in the section that follows NEW - Incorporates new content on Graph Theory - Coverage of algorithms appropriate for computer science majors, as well as students with no previous programming experience - Careful attention to mathematical logic and proof techniques - Instructor resources include an Instructor's Solutions Manual, slides in PowerPoint format, and additional Inquiry problems.
There are no comments on this title.
