Notes on Discrete Mathematics
by Miguel A. Lerma
Number of pages: 154
These notes are intended to be a summary of the main ideas in course CS 310: Mathematical Foundations of Computer Science which covers fundamental concepts and tools in discreet mathematics with emphasis on their applications to computer science. Topics include logic and Boolean circuits; sets, functions, relations, databases, and finite automata: deterministic algorithms, randomized algorithms, and analysis techniques based on counting methods and recurrence equations; trees and more general graphs.
Download or read it online for free here:
by Al Doerr, Ken Levasseur - Lulu.com
Applied Discrete Structures is a two semester undergraduate text in discrete mathematics, focusing on the structural properties of mathematical objects. These include matrices, functions, graphs, trees, lattices and algebraic structures.
by Ken Bogart, Cliff Stein - Dartmouth College
It gives thorough coverage to topics that have great importance to computer scientists and provides a motivating computer science example for each math topic. Contents: Counting; Cryptography and Number Theory; Reflections on Logic and Proof.
by Vladlen Koltun - Stanford University
Contents: Sets and Notation; Induction; More Proof Techniques; Divisibility; Prime Numbers; Modular Arithmetic; Relations and Functions; Mathematical Logic; Counting; Binomial Coefficients; Inclusion-Exclusion Principle; Pigeonhole Principle; etc.
by Marcel B. Finan - Arkansas Tech University
This book is designed for a one semester course in discrete mathematics for sophomore or junior level students. The text covers the mathematical concepts that students will encounter in computer science, engineering, Business, and the sciences.