
Class timings
Slot: D
Lecture: M 11:3012:25, Tu 9:3011:25
Tutorial: Th 7:308:25
Room No: CSE 119
Syllabus
Set theory and logic
 Logic and propositions, sets, set operations, functions,
relations, equivalence relations, partial orders, induction and recursion, finite
and infinite sets, countable and uncountable sets, Cantor's diagonal argument,
integers, rationals and real numbers.
 Combinatorics
 Pigeonhole principle, permutations and combinations,
summations, principal of inclusionexclusion, designs, generating functions,
linear recurrences and their solutions, divideandconquer relations.
 Algebraic structures
 Groups and subgroups, morphisms, permutations, rings,
domains, fields, polynomials, finite fields, error correcting codes, lattices,
Boolean algebra.

Recommended books
The following book will be mostly followed in the course:
Norman L Briggs, Discrete mathematics,
second edition, Oxford University Press.
Some other good books are:
J P Tremblay and R Manohar, Discrete mathematical structures with applications to
Computer Science, Tata McGrawHill Publishing Company, 1999.
C L Liu, Elements of discrete mathematics, 2nd edition, Tata McGrawHill
Publishing Company, 2000.
Additional handouts may also be provided in the class.
Notes on ideals and quotient rings:
pdf, ps.
Practice exercises
 Exercise Set 1 : pdf, ps.
 Exercise Set 2 : pdf, ps.
 Exercise Set 3 : pdf, ps.
 Exercise Set 4 : pdf, ps.
 Exercise Set 5 : pdf, ps.
Test papers
 Class test 1: September 08, 2005.
Questions [pdf, ps]
Solutions [pdf, ps]
 Midsemester test: September 16, 2005.
Questions [pdf, ps]
Solutions [pdf, ps]
 Class test 2: November 10, 2005.
Questions [pdf, ps]
Solutions [pdf, ps]
 Endsemester test: November 21, 2005.
Questions [pdf, ps]
Solutions [pdf, ps]

