Estb. 1882

University of the Punjab
Main Page > BS Computer Science > Discrete Structures

Discrete Structures

Sets.  Sequences and functions, Elementary logic.  Propositional calculus, Methods of Proof,  Mathematical induction, recurrence relation,  loop invariants.  Relations.  Equivalence of Relations and Partitions.  Partially ordered sets.  Properties of General Relations, Introduction to combinatorics.  Basic counting techniques.  Elementary Probability, Inclusion-exclusion principle and binomial methods.  Counting and partitions.  Pigeon hole principle.  Algebraic structures;  groups and semi-groups.

Credit hours/ Marks:- 3

Download Course-Outline