Who says maths is boring ?
Discrete mathematics
Course outline
This course is specifically tailored for students of computer science
and related subjects. A knowledge of discrete maths is essential for
success in the computer science profession. The course will consist of
traditional lecture sessions, interleaved with various other activities.
Students would be expected to take active part in the
mLEAD approach.
Students are strongly advised to follow this website, and
the course blog
regularly.
There is no specific or standard definition for what
a course on discrete maths should cover. Usually, the institution or the
University where I teach this course, will impose a certain syllabus. In which
case, I try to stick to the prescribed syllabus. In case, no specific
syllabus or
framework is prescribed, I will try to cover the following (subject to
available
duration, and the rate of absorption by the students) :
Primary content :
 Symbolic logic
 Graph theory
 Set theory
 Combinatorics
Extension :
 Advanced algebra
 Number theory
 Cryptology
In any case, lookout for a more specific outline from me, when I start the
course.
Books I follow
Books are not listed in any particular order. I would expect my students
to own at
least three titles from the books listed under "primary books", and
have access to all the books listed under "support books".
In addition to the books listed below, I may use material downloaded from
the wwweb. Any other book I find interesting, will be listed on the web,
and announced in the class
Primary books
 K H Rosen, Discrete mathematics and applications, Pub.:
Tata McGraw Hill. (Prof. Partha was a reviewer for
the 5th edition of
this book. This is a rare honour, reserved for the best gurus of discrete
mathematics.).
 R P Grimaldi, Discrete and combinatorial mathematics, Pub.:
Pearson Education.
 J L Mott, A kandel, T P Baker, Discrete mathematics for computer
scientists and mathematicians, Pub.: Prentice Hall of India.
 C L Lui, Elements of discrete mathematics, Pub.: McGraw Hill
 J P Tremblay, R Manohar, Discrete mathematical structures with
applications, Pub.: McGraw Hill.
 B Kolman, R C Busby, S Ross, Discrete mathematical structures,
Pub.: Prentice
Hall of India.
 S Lipshutz, M Lipson, Discrete mathematics, Pub.: Schaum's outline
series, Tata McGRaw Hill.
Support books
 S Lang, Algebra, Pub.: Springer Verlag.
 M Artin, Algebra, Pub.: Prentice Hall of India.
 S Birkhoff, S Maclane, A survey of modern algebra, Universities Press.
 Bruce Schneier, Applied cryptography, Pub. Wiley India
 J A Bondy, U S R Murty, Graph theory with applications, Pub.: North
Holland. (This book is a classic in graph theory. It
is also available in softcopy, as a PDF file, and can be downloaded from
the wwweb.)
 S M Cioba, M Ram Murty, A first course in graph theory and combinatorics, Pub. :
Hindustan Book Agency, Gurgaon, India.
 N Deo, Graph theory with applications to engineering and
computer science, Pub.: Prentice Hall India.
 Irving M Copi, Symbolic Logic, Pub.: Prentice Hall of India.
 Graham, Knuth, Patashnik, Concrete mathematics  a foundation for
computer
science, Pub.: Pearson Education.
General
 Goossens, Mittelbach, Samarin,The LaTeX Companion, Pub.: Addison
Wesley.
 H. Kopka, P W Daly, A guide to LaTeX 2e, Pub.: Addison Wesley
 G. Polya, How to solve it, Pub.: Prentice Hall of India.
 C.B. Boyer, U.C. Merzbach, A history of mathematics, Pub.: John Wiley.
 E.T. Bell, Men of mathematics, Pub.: Simon & Schuster.
Tutorial material from Prof. Partha
 Prof. Partha's CDROM on mathematics (you can ask for a copy).
Also, take a
look at the
catalogue of educational
CDROMs by Prof. Partha
 Downloadable publications from Prof. Partha
 You can
download
some of my earlier question papers from my
website.
Course methodolgy
Students would be expected to take active part in the
approach.
Prof. Partha will primarily be a facilitator, engaged in prompting
and nudging students, as they explore, discover, and learn discrete
mathematics. He
will be available to set goals, and remove genuine doubts and obstacles
in the learning process. To get the best of this course, students should interact closely
and frequently with Prof. Partha, as well as exhibit considerable
initiative to discover and learn. Prof. Partha feels that this approach
would be the most durable way to learn and appreciate mathematics.
There will of course be the traditional classroombased lectures,exercises and
exams also (let us all obey the rules).
You have a question ?
The Professor loves to answer your questions on discrete mathematics. But, do
not use this facility,
to get your homework/takehome assignment done by the Professor. And, do not be in
a hurry. The Professor will answer your questions, whenever he is not
under stress to complete some other obligation. The Professor will
acknowledge all your questions/mails and also
tell you approximately how long it will take to give you a definitive reply.
Or, he may give you pointers to resources where you can find the answer by
yourself (according to the mlead approach). Or, he may even ask you to come and meet him personally.
 Remember
to introduce yourself first (give me your :
name, age, gender, where do you live: city/country, which school
or University do you study, which year, which major).
 Give the name and email ID of your Professor/Guide/Supervisor/Class
teacher.
 Describe your problem/question. Be specific and to the point.
 Explain what steps did you take to solve the problem.
 Follow these simple guidelines: You need help ?
Queries which do not conform to the above format will be rejected, and no
response will come to you.
DO NOT SEND ME ANY MICROSOFT DOCUMENTS. YOU CAN SEND A LATEX FILE OR A
PDF FILE, IF YOU WANT.
