DISCRETE STRUCTURE (1 SEMESTER ONLY)

M I D T E R M

1. Introduction Discrete Structure

P A R T 1 : S E T S , R E L A T I O N S , A N D F U N C T I O N S
2. Sets
Set – Definition
Representation of a Set
Cardinality of a Set
Types of Sets
Venn Diagrams
Set Operations
Power Set
Partitioning of a Set

3. Relations (3) week 6

Definition and Properties
Domain and Range
Representation of Relations using Graph
Types of Relations
4. Functions (3)
Function – Definition
Injective / One-to-one function
Surjective / Onto function
Bijective / One-to-one Correspondent
Composition of Functions

P A R T 2 : M A T H E M A T I C A L L O G I C
5. Propositional Logic (5) week 7
Prepositional Logic – Definition
Connectives
Tautologies
Contradictions
Contingency
Propositional Equivalences
Inverse, Converse, and Contra-positive
Duality Principle
Normal Forms

6. Predicate Logic (2) week 8

Predicate Logic – Definition
Well Formed Formula
Quantifiers
Nested Quantifiers
7. Rules of Inference (5)
What are Rules of Inference for?
Addition
Conjunction
Simplification
Modus Ponens
Modus Tollens
Disjunctive Syllogism
Hypothetical Syllogism
Constructive Dilemma
Destructive Dilemma
Week 9 – Midterm Examination

F I N A L T E R M

P A R T 3 : G R O U P T H E O R Y
8. Operators and Postulates (5) week 10
Closure
Associative Laws
Commutative Laws
Distributive Laws
Identity Element
Inverse
De Morgan’s Law

9. Group Theory (5) week 11

Semigroup
Monoid
Group
Abelian Group
Cyclic Group and Subgroup
Partially Ordered Set (POSET)
Hasse Diagram
Linearly Ordered Set
Lattice
Properties of Lattices
Dual of a Lattice

P A R T 1 : C O U N T I N G & P R O B A B I L I T Y
1. Counting Theory (4) week 12
The Rules of Sum and Product
Permutations
Combinations
Pascal's Identity
Pigeonhole Principle
The Inclusion-Exclusion principle

2. Probability (3)
Basic Concepts
Probability Axioms
Properties of Probability
Conditional Probability
Bayes' Theorem

PART 2: MATHEMATICAL INDUCTION & RECURRENCE

RELATIONS
3. Mathematical Induction (1) week 13
Definition
How to Do It
Strong Induction
4. Recurrence Relation (2)
Definition
Linear Recurrence Relations
Particular Solutions
Generating Functions
P A R T 3 : D I S C R E T E S T R U C T U R E S
5. Graph and Graph Models (5) week 14
What is a Graph?
Types of Graphs
Representation of Graphs
Planar vs. Non-planar graph
Isomorphism
Homomorphism
Euler Graphs
Hamiltonian Graphs

6. More on Graph (1)

Graph Coloring
Graph Traversal
7. Introduction to Trees (4) week 14
Tree and its Properties
Centers and Bi-Centers of a Tree
Labeled Trees
Unlabeled trees
Rooted Tree
Binary Search Tree
8. Spanning Trees (2)
Minimum Spanning Tree
Kruskal's Algorithm
Prim's Algorithm

P A R T 4 : B O O L E A N A L G E B R A
9. Boolean Expressions and Functions (2) week 15
Boolean Functions
Boolean Expressions
Boolean Identities
Canonical Forms
Logic Gates
10. Simplification of Boolean Functions (2)
Simplification Using Algebraic Functions
Karnaugh Maps
Simplification Using K- map