PREV

• WEEK 1- 1st LECTURE (Introduction, Propositional Logic)
• WEEK 1- 2nd LECTURE (Applications of Propositional Logic, Propositional Equivalences)
• WEEK 2- 1st LECTURE (Predicates and Quantifiers, Nested Quantifiers)
• WEEK 2- 2nd LECTURE (Introduction to Proofs, Proof Methods and Strategy)
• WEEK 3- 1st LECTURE (Sets, Set Operations)
• WEEK 3- 2nd LECTURE (Set Functions, Sequences and Summations)
• WEEK 4- 1st LECTURE (Cardinality of Sets , Matrices)
• WEEK 4- 2nd LECTURE (Algorithms)
• WEEK 5- 1st LECTURE (The Growth of Functions)
• WEEK 5- 2nd LECTURE (Complexity of Algorithms)
• WEEK 6- 1st LECTURE (Divisibility and Modular Arithmetic)
• WEEK 6- 2nd LECTURE (Integer Representations and Algorithms, Primes and Greatest Common Divisors)
• WEEK 7- 1st LECTURE (Solving Congruences, Applications of Congruences, )
• WEEK 7- 2nd LECTURE (Cryptography)
• WEEK 8- 1st LECTURE (Applications of Recurrence Relations)
• WEEK 8- 2nd LECTURE (Solving Linear Recurrence Relations)
• WEEK 9- 1st LECTURE (Divide-and- Conquer Algorithms and Recurrence Relations)
• WEEK 9- 2nd LECTURE (Generating Functions, Inclusion Exclusion, Applications of Inclusion Exclusion)
• WEEK 10- 1st LECTURE (Relations and Their Properties , n-ary Relations and Their Applications)
• WEEK 10- 2nd LECTURE (Representing Relations, Closures of Relations)
• WEEK 11- 1st LECTURE (Equivalence Relations, Partial Orderings)
• WEEK 11- 2nd LECTURE (Graphs and Graph Models)
• WEEK 12- 1st LECTURE (Graph Terminology and Special Types of Graphs)
• WEEK 12- 2nd LECTURE (Representing Graphs, Connectivity)
• WEEK 13- 1st LECTURE (Shortest-Path Problems, Planar Graphs, Graph Coloring)
• WEEK 13- 2nd LECTURE (Introduction to Trees, Applications of Trees)
• WEEK 14- 1st LECTURE (Tree Traversal, Spanning Trees)
• WEEK 14- 2nd LECTURE (Minimum Spanning Trees)
• WEEK 14- 2nd LECTURE (Minimum Spanning Trees)
• WEEK 15- Semester Project Evaluation