142 results found in 6 ms.
Page 1 of 9 next
More OCW like this |
|
Published by: Massachusetts Institute of Technology | Language: English
Published by: Massachusetts Institute of Technology | Language: English
Share in:
This is an introductory course in Discrete Mathematics oriented toward Computer Science and Engineering. The course divides roughly into thirds:
Fundamental Concepts of Mathematics: Definitions, Proofs, Sets, Functions, Relations
Discrete Structures: Modular Arithmetic, Graphs, State Machines, Counting
Discrete Probability Theory
A versio
Author(s):
Tag(s):
- electrical engineering and computer science
- mathematical definitions
- proofs and applicable methods
- formal logic notation
- proof methods
- induction
- well-ordering
- sets
- relations
- elementary graph theory
- integer congruences
- asymptotic notation and growth of functions
- permutations and combinations
- counting principles
- discrete probability
- recursive definition
- structural induct
File: 6-042j-fall-2005.zip
This OER is part of OCW: Mathematics for Computer Science
Published under: /Download Course Materials
Share in:
Used by:
Inherited Tag(s):
- electrical engineering and computer science
- mathematical definitions
- proofs and applicable methods
- formal logic notation
- proof methods
- induction
- well-ordering
- sets
- relations
- elementary graph theory
- integer congruences
- asymptotic notation and growth of functions
- permutations and combinations
- counting principles
- discrete probability
- recursive definition
- structural induct
File: ps10.pdf
This OER is part of OCW: Mathematics for Computer Science
Published under: /Assignments
Share in:
OCW Authors:
Inherited Tag(s):
- electrical engineering and computer science
- mathematical definitions
- proofs and applicable methods
- formal logic notation
- proof methods
- induction
- well-ordering
- sets
- relations
- elementary graph theory
- integer congruences
- asymptotic notation and growth of functions
- permutations and combinations
- counting principles
- discrete probability
- recursive definition
- structural induct
File: ps5.pdf
This OER is part of OCW: Mathematics for Computer Science
Published under: /Assignments
Share in:
OCW Authors:
Inherited Tag(s):
- electrical engineering and computer science
- mathematical definitions
- proofs and applicable methods
- formal logic notation
- proof methods
- induction
- well-ordering
- sets
- relations
- elementary graph theory
- integer congruences
- asymptotic notation and growth of functions
- permutations and combinations
- counting principles
- discrete probability
- recursive definition
- structural induct
File: ps4.pdf
This OER is part of OCW: Mathematics for Computer Science
Published under: /Assignments
Share in:
OCW Authors:
Inherited Tag(s):
- electrical engineering and computer science
- mathematical definitions
- proofs and applicable methods
- formal logic notation
- proof methods
- induction
- well-ordering
- sets
- relations
- elementary graph theory
- integer congruences
- asymptotic notation and growth of functions
- permutations and combinations
- counting principles
- discrete probability
- recursive definition
- structural induct
File: ps2.pdf
This OER is part of OCW: Mathematics for Computer Science
Published under: /Assignments
Share in:
OCW Authors:
Inherited Tag(s):
- electrical engineering and computer science
- mathematical definitions
- proofs and applicable methods
- formal logic notation
- proof methods
- induction
- well-ordering
- sets
- relations
- elementary graph theory
- integer congruences
- asymptotic notation and growth of functions
- permutations and combinations
- counting principles
- discrete probability
- recursive definition
- structural induct
File: ps9.pdf
This OER is part of OCW: Mathematics for Computer Science
Published under: /Assignments
Share in:
OCW Authors:
Inherited Tag(s):
- electrical engineering and computer science
- mathematical definitions
- proofs and applicable methods
- formal logic notation
- proof methods
- induction
- well-ordering
- sets
- relations
- elementary graph theory
- integer congruences
- asymptotic notation and growth of functions
- permutations and combinations
- counting principles
- discrete probability
- recursive definition
- structural induct
File: ps8sol.pdf
This OER is part of OCW: Mathematics for Computer Science
Published under: /Assignments
Share in:
OCW Authors:
Inherited Tag(s):
- electrical engineering and computer science
- mathematical definitions
- proofs and applicable methods
- formal logic notation
- proof methods
- induction
- well-ordering
- sets
- relations
- elementary graph theory
- integer congruences
- asymptotic notation and growth of functions
- permutations and combinations
- counting principles
- discrete probability
- recursive definition
- structural induct
File: ps3.pdf
This OER is part of OCW: Mathematics for Computer Science
Published under: /Assignments
Share in:
OCW Authors:
Inherited Tag(s):
- electrical engineering and computer science
- mathematical definitions
- proofs and applicable methods
- formal logic notation
- proof methods
- induction
- well-ordering
- sets
- relations
- elementary graph theory
- integer congruences
- asymptotic notation and growth of functions
- permutations and combinations
- counting principles
- discrete probability
- recursive definition
- structural induct
File: ps8.pdf
This OER is part of OCW: Mathematics for Computer Science
Published under: /Assignments
Share in:
OCW Authors:
Inherited Tag(s):
- electrical engineering and computer science
- mathematical definitions
- proofs and applicable methods
- formal logic notation
- proof methods
- induction
- well-ordering
- sets
- relations
- elementary graph theory
- integer congruences
- asymptotic notation and growth of functions
- permutations and combinations
- counting principles
- discrete probability
- recursive definition
- structural induct
File: ps1sol.pdf
This OER is part of OCW: Mathematics for Computer Science
Published under: /Assignments
Share in:
OCW Authors:
Inherited Tag(s):
- electrical engineering and computer science
- mathematical definitions
- proofs and applicable methods
- formal logic notation
- proof methods
- induction
- well-ordering
- sets
- relations
- elementary graph theory
- integer congruences
- asymptotic notation and growth of functions
- permutations and combinations
- counting principles
- discrete probability
- recursive definition
- structural induct
File: ps6sol.pdf
This OER is part of OCW: Mathematics for Computer Science
Published under: /Assignments
Share in:
OCW Authors:
Inherited Tag(s):
- electrical engineering and computer science
- mathematical definitions
- proofs and applicable methods
- formal logic notation
- proof methods
- induction
- well-ordering
- sets
- relations
- elementary graph theory
- integer congruences
- asymptotic notation and growth of functions
- permutations and combinations
- counting principles
- discrete probability
- recursive definition
- structural induct
File: ps1.pdf
This OER is part of OCW: Mathematics for Computer Science
Published under: /Assignments
Share in:
OCW Authors:
Inherited Tag(s):
- electrical engineering and computer science
- mathematical definitions
- proofs and applicable methods
- formal logic notation
- proof methods
- induction
- well-ordering
- sets
- relations
- elementary graph theory
- integer congruences
- asymptotic notation and growth of functions
- permutations and combinations
- counting principles
- discrete probability
- recursive definition
- structural induct
File: ps7sol.pdf
This OER is part of OCW: Mathematics for Computer Science
Published under: /Assignments
Share in:
OCW Authors:
Inherited Tag(s):
- electrical engineering and computer science
- mathematical definitions
- proofs and applicable methods
- formal logic notation
- proof methods
- induction
- well-ordering
- sets
- relations
- elementary graph theory
- integer congruences
- asymptotic notation and growth of functions
- permutations and combinations
- counting principles
- discrete probability
- recursive definition
- structural induct
File: ps6.pdf
This OER is part of OCW: Mathematics for Computer Science
Published under: /Assignments
Share in:
OCW Authors:
Inherited Tag(s):
- electrical engineering and computer science
- mathematical definitions
- proofs and applicable methods
- formal logic notation
- proof methods
- induction
- well-ordering
- sets
- relations
- elementary graph theory
- integer congruences
- asymptotic notation and growth of functions
- permutations and combinations
- counting principles
- discrete probability
- recursive definition
- structural induct
File: ps3sol.pdf
This OER is part of OCW: Mathematics for Computer Science
Published under: /Assignments
Share in:
OCW Authors:
Inherited Tag(s):
- electrical engineering and computer science
- mathematical definitions
- proofs and applicable methods
- formal logic notation
- proof methods
- induction
- well-ordering
- sets
- relations
- elementary graph theory
- integer congruences
- asymptotic notation and growth of functions
- permutations and combinations
- counting principles
- discrete probability
- recursive definition
- structural induct
142 results found.
Page 1 of 9 next