000			01901nam a22002177a 4500
003			CUTN
005			20180912111553.0
008			180912b xxu||||| |||| 00| 0 eng d
020			_a9788120350748
041			_aEnglish
082			_a511.6 _bCHO
100			_aChowdhary, K. R.
245			_aFundamentals of Discrete mathematical structures _cK. R. Chowdhary
250			_a3rd ed.
260			_aNew Delhi : _bPHI Learning, _c2015.
300			_axvii, 341 p.: _bill.; _c24 cm.
505			_tDiscrete Structures and Set Theory _tInduction, Recursion and Recurrences _tCombinatorics _tDiscrete Probability _tMathematical Logic _tLogical Inferencing _tPredicate Logic _tGraph Theory _tRelations _tTransitive Closure and Warshall’s Algorithm _tEquivalence and Partial Ordering Relations _tTrees _tAlgebraic Systems _tLanguages, Automata and Grammars _tPrime Numbers and Cryptosystems
650			_aDiscrete mathematics
942			_2ddc _cBOOKS
520			_aThis updated text, now in its Third Edition, continues to provide the basic concepts of discrete mathematics and its applications at an appropriate level of rigour. The text teaches mathematical logic, discusses how to work with discrete structures, analyzes combinatorial approach to problem-solving and develops an ability to create and understand mathematical models and algorithms essentials for writing computer programs. Every concept introduced in the text is first explained from the point of view of mathematics, followed by its relation to Computer Science. In addition, it offers excellent coverage of graph theory, mathematical reasoning, foundational material on set theory, relations and their computer representation, supported by a number of worked-out examples and exercises to reinforce the students’ skill.
999			_c25798 _d25798