Accueil
Connexion
DENIF –
Documents d’Enseignement Numériques en Informatique Fondamentale
Thèmes
Cursus
Enseignants
Mathematics for Computer Science
Thème :
Mathématiques
–
Cursus :
MIT
Spring 2005
Instructors: Prof. Srinivas Devadas, Dr. Eric Lehman. Contributors: Prof. Albert Meyer, Prof. Charles Leiserson.
Lecture Notes
Logic and Sets
Proofs
Induction I
Induction II
Induction III
Number Theory I
Number Theory II
Graphs I
Graphs II
Summations
Approximations, Asymptotics
Recurrences
Counting I
Counting II
Counting III
Generating Functions
Probability
Conditional Probability
Independence
Random Variables and Distributions
Expectation I
Expectation II
Random Walks
Special Topics
Problem Set and Solutions
Set 1
Set 2
Set 3
Set 4
Set 5
Set 6
Set 7
Set 8
Set 9
Set 10
Set 11
Recitations
Logic
Case Analysis
Induction
Strong Induction
Well-ordering Principle
The Pulverizer
RSA
Graphs and Trees
Bipartite Graphs
Sums and Approximations
The Quest
Solving Linear Recurrences
Basic Counting Notions
Counting Rules
Counting
Generating Functions and Expressions
The Four-Step Method
Law of Total Probability
Probability
Random Variables, Distributions, etc.
Expected Value
Conditional and Total Expectation
Stencil the Flea