Mathematics for Computer Science (2010)

Mathematics for Computer Science (2010)

Follow Mathematics for Computer Science (2010)

Share on

This course covers elementary discrete mathematics. Mathematical definitions and proofs are emphasized. Topics include formal logic, induction, graph theory, asymptotic notation and growth of functions, counting principles, and discrete probability.

Tom Leighton, Marten van Dijk

Feb 17, 2012 LATEST EPISODE
infrequent NEW EPISODES
1h 19m AVG DURATION
25 EPISODES

Search for episodes from Mathematics for Computer Science (2010) with a specific topic:

Latest episodes from Mathematics for Computer Science (2010)

Lecture 23: Expectation II

Play Episode Listen Later Feb 17, 2012 83:43

expectation lecture

Lecture 24: Large Deviations

Play Episode Listen Later Feb 17, 2012 83:21

large lecture deviations

Lecture 25: Random Walks

Play Episode Listen Later Feb 17, 2012 77:52

Lecture 22: Expectation I

Play Episode Listen Later Feb 17, 2012 83:53

expectation lecture

Lecture 21: Random Variables

Play Episode Listen Later Feb 17, 2012 82:58

lecture variables

Lecture 20: Independence

Play Episode Listen Later Feb 17, 2012 82:01

independence lecture

Lecture 19: Conditional Probability

Play Episode Listen Later Feb 17, 2012 81:45

lecture probability conditional

Lecture 17: Counting Rules II

Play Episode Listen Later Feb 17, 2012 85:23

counting lecture

Lecture 18: Probability Introduction

Play Episode Listen Later Feb 17, 2012 83:55

lecture probability

Lecture 16: Counting Rules I

Play Episode Listen Later Feb 17, 2012 80:01

counting lecture

Lecture 10: Graph Theory III

Play Episode Listen Later Feb 17, 2012 82:49

lecture graphs graph theory

Lecture 12: Sums

Play Episode Listen Later Feb 17, 2012 78:21

Lecture 13: Sums and Asymptotics

Play Episode Listen Later Feb 17, 2012 83:39

Lecture 15: Linear Recurrences

Play Episode Listen Later Feb 17, 2012 78:19

lecture linear recurrences

Lecture 14: Divide and Conquer Recurrences

Play Episode Listen Later Feb 17, 2012 82:45

lecture divide and conquer recurrences

Lecture 11: Relations, Partial Orders, and Scheduling

Play Episode Listen Later Feb 17, 2012 63:59

lecture relations scheduling orders partial

Lecture 9: Communication Networks

Play Episode Listen Later Feb 17, 2012 83:24

lecture communication networks

Lecture 8: Graph Theory II: Minimum Spanning Trees

Play Episode Listen Later Feb 17, 2012 83:25

trees lecture minimum graphs spanning graph theory

Lecture 7: Matching Problems

Play Episode Listen Later Feb 17, 2012 82:40

lecture matching

Lecture 6: Graph Theory and Coloring

Play Episode Listen Later Feb 17, 2012 82:50

lecture graphs coloring graph theory

Lecture 5: Number Theory II

Play Episode Listen Later Feb 17, 2012 78:44

lecture number theory

Lecture 4: Number Theory I

Play Episode Listen Later Feb 17, 2012 80:24

lecture number theory

Lecture 2: Induction

Play Episode Listen Later Feb 17, 2012 79:24

Lecture 3: Strong Induction

Play Episode Listen Later Feb 17, 2012 81:59

Lecture 1: Introduction and Proofs

Play Episode Listen Later Feb 17, 2012 44:09

Claim Mathematics for Computer Science (2010)

In order to claim this podcast we'll send an email to with a verification link. Simply click the link and you will be able to edit tags, request a refresh, and other features to take control of your podcast page!