Topics in Discrete Mathematics
by A.F. Pixley
Publisher: Harvey Mudd College 2010
Number of pages: 173
Description:
This text is intended as an introduction to a selection of topics in discrete mathematics: Combinatorics; The Integers; The Discrete Calculus; Order and Algebra; Finite State Machines. The prerequisites include linear algebra and elementary computer programming.
Download or read it online for free here:
Read online
(online reading)
Similar books

by Edward A. Bender, S. Gill Williamson - Dover Publications
This text assists undergraduates in mastering the mathematical language to address problems in the field's many applications. It consists of 4 units: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.
(30860 views)

by Edward A. Bender, S. Gill Williamson - University of California, San Diego
In this book, four basic areas of discrete mathematics are presented: Counting and Listing, Functions, Decision Trees and Recursion, and Basic Concepts in Graph Theory. At the end of each unit is a list of Multiple Choice Questions for Review.
(6917 views)

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.
(9238 views)

by Miguel A. Lerma
Summary of the course CS 310: Mathematical Foundations of Computer Science. It covers concepts of discreet mathematics and applications to computer science, logic and Boolean circuits, functions, sets, relations, databases, finite automata, and more.
(19163 views)