EE-Learning
Methods of Proof
Catogry:
Computing
Subject:
Computer Science
Course:
Discrete Mathematical Structures
Lecture List
Lattices
Finite State Automaton(contd….) I
Finite State Automaton
Algebras(contd…) II
Algebras(contd…) I
Algebras
Recurrence Relations(contd..) II
Recurrence Relations I
Recurrence Relations
Generating Functions I
Generating Functions
Permutations and Combinations(Contd…) I
Permutations and combinations
Pigeonhole Principle
Functions (Contd.) II
Functions (Contd.) I
Functions
Equivalence relations and partitions
Order and Relations and Equivalence Relations
Order Relations
Closure of Relations (Contd.) I
Closure of Relations
Special Properties of Relations
Trees and Graphs
Trees
Graphs (Contd.) I
Graphs
Relations
Set Operations on Strings Over an Alphabet
Induction
Sets
Proving programs correct – I
Normal Forms
Methods of Proof
Resolution Principles & Application to PROLOG
Logical Inference
Predicates & Quantifiers (Contd.)
Predicates & Quantifiers
Propositional Logic
What is Discrete Mathematics