PMAT 12532: Discrete Mathematics II

User Rating: 5 / 5

Star ActiveStar ActiveStar ActiveStar ActiveStar Active
 

Course code  :  PMAT 12532

Title               :  Discrete Mathematics II

Pre-requisites :  PMAT 11513

Learning Outcomes:

On successful completion of the course, the student should be able to;

  • demonstrate knowledge in applications of the fundamental theorem of arithmetic
  • demonstrate knowledge in fundamental notions of graph theory

 Course Contents:

Counting: Basic principles of counting; pigeonhole principle; Permutations and combinations.

Number Theory: Divisibility; Modular arithmetic; The fundamental theorem of arithmetic.

Graph Theory: Graph terminology; Special types of simple graphs; Subgraphs;  Euler cycles; Hamiltonian cycles; Representations of graphs; Isomorphic graphs; Planar graphs; Kuratowski’s theorem;  Graph colouring.

 Method of Teaching and Learning: A combination of lectures and tutorial discussions.

 Assessment: Based on tutorials, tests and end of course examination.

 Recommended Reading:

  1. Johnsonbaugh, R., (8th edition , 2017), Discrete Mathematics, Pearson.
  2. Rosen, K.H., Krithivasan, K., (7th edition, 2013), Discrete Mathematics and Its Applications, McGraw-Hill.
© 2022 Department of Mathematics, Faculty of Science, University of Kelaniya, Sri Lanka. All Rights Reserved.