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.
"synopsis" may belong to another edition of this title.
(No Available Copies)
Search Books: Create a WantCan't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!
Create a Want