Discrete Mathematics and Its Applications

Designed for undergraduate courses in Discrete Mathematics found in either the Mathematics or Computer Science Departments, this text offers a strong view of the core topics and a wide variety of optional ones. This flexible organization allows the text to fit into a wide array of course outlines. Topics presented using five central themes - mathematical reasoning, combinatorial analysis, discrete structures; algorithms are treated as a central theme of the course and described in both English and Pascal-like pseudocode; and combinatorics are extensively covered including counting techniques and graph theory.