CS201: Mathematics for Computer Science - I (Sem I, 2016-17)

 

Links


Books, LectureS



Course, CS201, Rajat Mittal.

Discrete Mathematics and its Applications, K H Rosen.
Discrete Mathematics, N L Biggs.

Combinatorics: Topics, Techniques, Algorithms, Peter Cameron.
A Course in Combinatorics, J H van Lint and R M Wilson.

Introduction to Theory of Numbers, I Niven and H Zuckerman.
An Introduction to the Theory of Numbers, G H Hardy and E M Wright.

A first course in Probability, S Ross.
Elementary Probability, D Stirzaker.
Understanding Probability, H Tijms.
The Probabilistic Method, N Alon and J Spencer.

Concrete Mathematics: A Foundation for Computer Science, R Graham, D Knuth and O Patashnik.

Online Stuff


Discrete Math
notes.
Open problems.

History: Discrete mathematics.

------------------------------------------------------
``You also get dramatic advances when you spot that you can leave out part of the problem. Algebra, for instance (and hence the whole of computer programming), derives from the realisation that you can leave out all the messy, intractable numbers.''

-- Douglas Adams (The Salmon of Doubt: Hitchhiking the Galaxy One Last Time, 2002).