# Discrete mathematics

From Wikiversity

Welcome to the Topic of Discrete Mathematics, a department of the School of Mathematics and School of Computer Science. Discrete mathematics is very important for studying computer science.

Discrete Mathematics is a broad subject encompassing several formal systems for dealing with discrete quantities. If you are studying Discrete Mathematics as part of a related field, you may wish to follow one of the links below to a streamlined set of core topics that you need. A complete list of Discrete Mathematics topics is given below.

## Contents

## Core Topics for Related Studies[edit]

- Topic:Introductory Discrete Mathematics for Computer Science
- Topic:Discrete Mathematics for Computer Science

## Complete List of Subjects[edit]

- Topic:Algorithmics
- Collections
- Topic:Combinatorics
- Topic:Complexity
- Topic:Computability
- Topic:Counting
- Topic:Digital geometry
- Topic:Digital topology
- Functions
- Topic:Graph theory
- Topic:Information theory
- Topic:Linear algebra
- Topic:Logic
- Topic:Markov chains
- Topic:Number theory
- Partially Ordered Sets
- Topic:Probability
- Proofs
- Relations
- Topic:Set theory

Until lessons are completed, you may wish to visit wikipedia for more info. There's a lot there - you may wish to start up another pot of coffee.

## References[edit]

## Off-site courses[edit]

*Discrete Math*, Michael Damron, New York University, Fall 2008. (Earlier versions: Spring 2007)*Introduction to Contemporary Mathematics*, Larry Bowen, University of Alabama.*Discrete Structures*, Margaret Fleck and Eric Shaffer, Spring 2009*Discrete Mathematics*, Ben Maloney, University of Wollongong, Summer 2010-2011.*Discrete Mathematics I*, Peter G. Binev, University of South Carolina, Fall 2006.