Elementary Number Theory; Propositional Logic; Sets; Predicate Logic; Linear Rec urrence Relation; Relations and Functions;

Graphs; Complex Numbers; Vectors and Matrices; Elementary Combinatorics. This module introduces mathematical tools required in the study of computer scie nce. Topics include: (1) Logic and proof techniques: propositions, conditionals, quantifications. (2) Relations and Functions: Equivalence relations and partiti ons. Partially ordered sets. Well-Ordering Principle. Function equality. Boolean /identity/inverse functions. Bijection. (3) Mathematical formulation of data mod els (linear model, trees, graphs). (4) Counting and Combinatoric: Pigeonhole Pri nciple. Inclusion-Exclusion Principle. Number of relations on a set, number of i njections from one finite set to another, Diagonalisation proof: An infinite cou ntable set has an uncountable power set; Algorithmic proof: An infinite set has a countably infinite subset. Subsets of countable sets are countable. 1. 2. Functions, Relations and Sets Basic Logic Propositional Logic Logical Connectives Truth Tables Normal Forms Validity Predicate Logic