Alan Doerr and Kenneth Levasseur

Digital versions PDF and HTML (part 1)
Latex source No
Exercises Yes
Solutions Yes
License Creative Commons Attribution-Noncommercial-Share Alike 3.0
  • Text for a sophomore level discrete structures course
  • Version 2.0, March 2013
  • Previously published by Pearson as Applied Discrete Structures for Computer Science
  • 494 pages, 16 chapters
  • Exercises and supplemental exercises for each chapter; short answers to odd-numbered problems
  • Some concepts illustrated with Sage enabled web pages
  • Print versions from Lulu: $30 for entire book, $21 for chapters 1–10, $16 for chapters 11–16
  • Also available is a Mathematica version with each chapter a notebook
  • 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.