Discrete Mathematics and its applications
Material type:
- 9789390727353
- 23 511 R0SD
Item type | Current library | Collection | Call number | Status | Barcode | |
---|---|---|---|---|---|---|
![]() |
St Aloysius Library | Mathematics | 511 R0SD (Browse shelf(Opens below)) | Available | 077173 | |
![]() |
St Aloysius Library Reference Section | Mathematics | 511 R0SD (Browse shelf(Opens below)) | Reference Book | 077174 |
Discrete Mathematics and its applications, 8th edition by Kenneth H. Rosen and its Indian adaptation by Kamala krithivasan is suitable for the students of computer Science engineering, information Technology, and Mathematics. Divided into 13 chapters, the revised Indian adaptation provides an in-depth treatment of the subject to help the students understand the concepts of the subject area in an effective manner. The book not only teaches important mathematical concepts but also the application of these concepts. To enhance logical and mathematical skills, The book lays special emphasis on mathematical Reasoning and problem-solving abilities of the students. salient features: 1) Complete coverage of the AICTE model curriculum for discrete Mathematics 2) inclusion of important topics such as algebraic structures and coding theory 3) a precise, relevant, and comprehensive approach towards mathematical concepts without excessive formalism and abstraction 4) adoption of top-down approach, that is, basic concepts are taught first and then the advanced level concepts 5) All definitions and theorems are stated extremely carefully so that the readers appreciate the precision of language and rigor needed in Mathematics 6) includes applications which can be applied to a wide variety of areas, including computer Science, data networking, psychology, Chemistry, engineering, linguistics, Biology, business, and the Internet 7) 800+ examples are used to illustrate concepts, relates different topics, and introduce applications 8) 4200+ exercises in the text, with many different types of questions 9) 150+ Computer projects tie together what readers may have learned in computing and in discrete Mathematics.
Table of contents: 1. The Foundations: Logic and Proofs 2. Basic Structures: Sets, Functions, Sequences, Sums, and Matrices 3. Algorithms 4. Number Theory and Cryptography 5. Induction and Recursion 6. Counting 7. Advanced Counting Techniques 8. Relations 9. Graphs 10. Trees 11. Boolean Algebra 12. Algebraic Structures and Coding Theory 13. Modeling Computation Key Terms and Results Review Questions Supplementary Exercises Computer Projects Computations and Explorations Writing Projects
There are no comments on this title.