CS201A - Mathematics For Computer Science -I
Prerequisites:
3-0-0-9
Course Contents
- Mathematical proofs, proofs by induction, by contradiction, proving the contra positive.
- Basic counting techniques, pigeonhole principle, recurrence relations, generating functions, principle of inclusion and exclusion, Mobius inversion.
- Graphs, trees definitions. Connectivity, paths, cycles, Euler Ian walks, Hamiltonian cycles, cliques, colorings, graph matching, planarity.
- Discrete probability. Sample space, events, probability basic laws, discrete random variable, expectation, linearity of expectation, independence, conditioning, Bays theorem, Bernoulli, binomial and geometric distributions, moments and deviations, Markov, Tchebyshev 's inequalities, Chern off bounds.
- Application of probabilistic methods in combinatory and graph theory.
Topics
Current Course Information
Instructor(s):
Number of sections:
Tutors for each section:
Schedule for Lectures:
Schedule for Tutorial:
Schedule for Labs: