000			02138nam a2200277Ia 4500
003			OSt
005			20250808102735.0
008			220909b |||||||| |||| 00| 0 eng d
020			_a9780070648241
037			_cTextual
040			_aCSL _beng _cCSL
041			_aeng
084			_aB0bD P7-;1 _qCSL
100			_aRosen, Kenneth H. _9431600
245		0	_aDiscrete mathematics and its applications with combinatorics and graph theory
250			_a6th ed.
260			_aNew Delhi: _bTata McGraw-Hill Education Private Limited, _c2007.
300			_axxi, 787p. _b: ill.
500			_aBibliography B1-B9p.; Index I1-I23p.
520			_aThe book gives a lot of stress on mathematical reasoning, combinatorial analysis, algorithmic thinking, and applications and modeling. One of the most popular book in use, it gives a presentation of the subject in great depth. The text is strengthened with a host of pedagogical tools which help in making it student friendly. New to this edition Language used is easy to understand. Comprehensive coverage of Induction, Recursion, and Counting. Algorithms in the text are given using pseudocodes. Applications included, demonstrate the utility of the subject in terms of Real-World problems. Pedagogical Features: 2992 Exercise Problems 195 Review Questions 480 Supplementary Exercises 152 Computer Projects 93 Computations & Explorations 140 Writing Projects New to the Edition: A separate chapter on Discrete Structures (Chapter 2) The new chapter 4 on Induction and Recursion. Conditional Statements & De Morgan's Laws receive expanded coverage. Material on Valid Arguments and Rules of Inference is presented in a separate section. Coverage of Turing Machines expanded. Over 400 new exercises and several new examples have been added. The introduction of Basic Counting Techniques, and Permutations and Combinations enhanced.
650			_a Discrete mathematics _9817507
650			_aMathematics
942			_hB0bD P7-;1 _cTEXL _2CC _e7th _n0
999			_c29187 _d29187