Lecture Notes in Discrete Mathematics
by Marcel B. Finan
Publisher: Arkansas Tech University 2001
Number of pages: 224
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 many disciplines such as computer science, engineering, Business, and the sciences.
Home page url
Download or read it online for free here:
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.
by Eric Lehman, F Thomson Leighton, Albert R Meyer - MIT
An introduction to discrete mathematics oriented toward Computer Science and Engineering. Topics covered: Fundamental concepts of Mathematics: sets, functions, number theory; Discrete structures: graphs, counting; Discrete probability theory.
by W W L Chen - Macquarie University
Logic and sets, the natural numbers, division and factorization, languages, finite state machines, finite state automata, Turing machines, groups and modulo arithmetic, introduction to coding theory, group codes, public key cryptography, etc.
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.