000 03087nam a22003017a 4500
005 20240311113338.0
008 240311b ||||| |||| 00| 0 eng d
020 _a9789390727353
040 _cAL
041 _aeng
082 _223
_a511
_bR0SD
100 _aKenneth H Rosen
_9153675
245 _aDiscrete Mathematics and its applications
250 _a8
260 _aChennai
_bMc Graw Hill Education India Pvt Ltd
_c2022
300 _axxvi,1100p.
_bPB
_c23x18cm.
365 _2Mathematics
_a8446
_b525.00
_c
_d840
_e20%
_f06-03-2024
520 _aDiscrete 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.
521 _aTable 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
650 _aBasic Structures
_9153656
650 _aLogic and Proffs
_9153657
650 _aGraphs
_9153658
650 _aBoolean Algebra
_9153659
650 _aModeling Computation
_9153660
700 _aROSEN (Kenneth H)
_9153661
700 _aKRITHIVASAN (Kamala)
_9153662
942 _2ddc
_cBK
999 _c230196
_d230196