This 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.
**Primarily intended for undergraduate students of Computer Science and Engineering, and Information Technology, this text will also be useful for undergraduate and postgraduate students of Computer Applications.**
**New to this Edition**
Incorporates many new sections and subsections such as recurrence relations with constant coefficients, linear recurrence relations with and without constant coefficients, rules for counting and shorting, Peano axioms, graph connecting, graph scanning algorithm, lexicographic shorting, chains, antichains and order-isomorphism, complemented lattices, isomorphic order sets, cyclic groups, automorphism groups, Abelian groups, group homomorphism, subgroups, permutation groups, cosets, and quotient subgroups.
Includes many **new worked-out examples, definitions, theorems, exercises, and GATE level MCQs with answers**. |