Discrete Mathematics

Discrete Mathematics is a textbook designed for the students of computer science engineering, information technology, and computer applications to help them develop their foundations of theoretical computer science. With a detailed introduction to the propositional logic, set theory, and relations, the book in further chapters explores the mathematical notions of functions, integers, counting techniques, probability, discrete numeric functions and generating functions, recurrence relations, algebraic structures, poset and lattices. The discussion ends with the chapter on theory of formal and finite automata, graph theory and applications of discrete mathematics in various domains. Adopting a solved problems approach to explaining the concepts, the book presents numerous theorems, proofs, practice exercises, and multiple choice questions. "A textbook designed for the students of computer science engineering, information technology, and computer applications to help them develop the foundation of theoretical computer science ... Adopting a solved problems approach to explain the concepts, the book presents numerous theorems, proofs, practice exercises, and multiple-choice questions."--Page 4 of cover