Programmes

BACHELOR OF SCIENCE IN SOFTWARE ENGINEERING

PMAT 21042

DISCRETE MATHEMATICS FOR COMPUTING II

Status : Elective Pre-requisite : PMAT 12102 Co-requisite : None

 

On completion of this course, the student should be able to:

  • Apply matrices in analyzing systems of linear equations
  • Apply counting techniques in modelling real world problems
  • Explain basic graph theory.

Matrices: Matrix notations, Algebra of matrices, Inverse of a matrix, Elementary row operations and calculation of inverse matrix, Determinant of a matrix, Minor and cofactor, Properties of determinants, Adjoint of a matrix and calculation of inverse matrix.

Systems of Linear Equations: Matrix form of a system of equations and conditions for unique solutions, augmented matrix and echelon form, Conditions for existence of a unique solution, infinitely many solutions and no-solution.

Counting Techniques: Factorial notation, Sum rule and product rule, Permutations and combinations, Binomial expansion.

Graphs: Graph notation and basic definitions, Complete and bipartite graphs, Euler and Hamiltonian circuits, Directed and undirected graphs, Trees and their basic properties.

Lectures, interactive classroom sessions, and case discussions.

End of course unit examination, group assignments, mid-term examination,class attendance.

  1. Epp, SS(2011). Discrete Mathematics with Applications.Brooks Cole
  2. Rosen, K H (2012). Discrete Mathematics and Its Applications. McGraw-Hill.

Back