FUNDAMENTALS OF DISCRETE MATHEMATICAL STRUCTURES

This thoroughly revised and updated text, now in its Second 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 be also useful for undergraduate and postgraduate students of Computer Applications.
NEW TO THIS EDITION :
• Contains many new sections such as Russell’s paradox, injection, surjection, bijection, Schroeder-Bernstein theorem, graph and map coloring, and Bipartite graph.
• Includes more questions in chapter-end Exercises.