Alan Doerr and Kenneth Levasseur

Digital versions PDF and HTML
Open source Yes, MathBook XML and LaTeX
Exercises Yes
Solutions Yes
License Creative Commons Attribution-Noncommercial-Share Alike 3.0
  • Text for a sophomore level discrete structures course
  • Version 3.2, January 2017
  • Previously published by Pearson as Applied Discrete Structures for Computer Science
  • 567 pages, 16 chapters
  • Exercises for each section; short answers to odd-numbered problems
  • Some concepts illustrated with Sage enabled web pages
  • Print versions from Lulu: $35 for entire book, $25 for chapters 1–10, $18.50 for chapters 11–16
  • Course adoption list available
  • For more information and to download

This textbook contains the content of a two semester course in discrete structures, which is typically a second-year course for students in computer science or mathematics, but it does not have a calculus prerequisite. The material for the first semester is in chapters 1-10 and includes logic, set theory, functions, relations, recursion, graphs, trees, and elementary combinatorics. The second semester material in chapters 11-16 deals with algebraic structures: binary operations, groups, matrix algebra, Boolean algebra, monoids and automata, rings and fields.