This is the CS151 homepage

The material on the course was taken from the following sections of the course text: 1.1, 1.2, 1.3, 2.1, 2.2, 2.3, 3.1, 3.2, 4.4, 6.1, 6.2, 7.1, 7.2. Only selected material in each section was covered, as specified below.

CS151 Discrete Structures 1, Department of Computer Science, National University of Ireland, Maynooth
T Naughton, 2004-2005
Lecture	Date	Topic
1	22-Sep	Course outline, logical statements, truth tables, negation
2	22-Sep	Propositions, AND, OR, conditional
3	29-Sep	Equivalence, laws of equivalence
4	29-Sep	Proving equivalence using truth tables, and using laws of equivalence
5	06-Oct	Divisibility and prime numbers
6	06-Oct	Proof techniques: exhaustive techniques, counter examples
7	13-Oct	Proof techniques: conditional proof (direct approach), proving the contrapositive
8	13-Oct	Proof techniques: proof by contradiction, if and only if proofs
9	20-Oct	Sets: defining sets, subset, proper subset, proof strategies
10	20-Oct	Sets: proof strategies, power sets
11	27-Oct	Class test 1
12	27-Oct	Class test 2
13	10-Nov	Sets: union, intersection, difference, symmetric difference, complement
14	10-Nov	Bags, multisets, tuples, lists, operations on lists, composition of functions
15	17-Nov	Cartesian product, relations
16	17-Nov	Functions, domain, co-domain, range
17	24-Nov	Functions as relations, tuples as functions
18	24-Nov	Special functions: abs, floor, ceiling, mod
19	01-Dec	Bijections, inverse of a function
20	01-Dec	Inverse of a bijection
21	08-Dec	Class test 3
22	08-Dec	Predicate logic
23	15-Dec	Induction, inductively defined sets, recursive functions
24	15-Dec	Proof by induction