Mathematical Structures For Computer Science : ... Apr 2026

: Recursive definitions, solving recurrence relations, and algorithm complexity.

: Available as an e-book with highlighting, search, and note-taking tools on platforms like VitalSource . Mathematical Structures for Computer Science, 7th Edition Mathematical structures for computer science : ...

According to Macmillan Learning , the book is organized into the following major chapters: : Recursive definitions

: Warshall's algorithm, Euler and Hamiltonian paths, shortest paths (minimal spanning trees), and traversal algorithms. solving recurrence relations

: Basic set theory, counting principles (pigeonhole principle), permutations, combinations, and the binomial theorem.

: Statements, symbolic representation, tautologies, propositional logic, quantifiers, predicates, and logic programming.

: The textbook is designed to meet the proposed standards for discrete mathematics courses as set by the ACM and IEEE.