Course

M203 - Discrete Mathematics

Course No: 
M203
Credit: 
4
Prerequisites: 
M101
Approval: 
2014
UG-Core
Syllabus: 
Pigeonhole principle, Counting principles, Binomial coefficients, Principles of inclusion and exclusion, recurrence relations, generating functions, Catalan numbers, Stirling numbers, Partition numbers, Schr ̈oder numbers, Block designs, Latin squares, Partially ordered sets, Lattices, Boolean algebra.
Text Books: 
  1. R. A. Brualdi, “Introductory Combinatorics”, Pearson Prentice Hall, 2010.
  2. J. P. Tremblay, R. Manohar, “Discrete Mathematical Structures with Application to Computer Science”, Tata McGraw-Hill Edition, 2008.
Reference Books: 
  1. J. H. van Lint, R. M. Wilson, “A Course in Combinatorics”, Cambridge University Press, 2001. 
  2. I. Anderson, “A First Course in Discrete Mathematics”, Springer Undergraduate Mathematics Series, 2001.
  3. R. P. Stanley, “Enumerative Combinatorics Vol. 1”, Cambridge Studies in Advanced Mathematics, 49, Cambridge University Press, 2012.

Contact us

School of Mathematical Sciences

NISERPO- Bhimpur-PadanpurVia- Jatni, District- Khurda, Odisha, India, PIN- 752050

Tel: +91-674-249-4081

Corporate Site - This is a contributing Drupal Theme
Design by WeebPal.