Modules / Lectures
Module NameDownload
Week_01_Assignment_01Week_01_Assignment_01
Week_02_Assignment_02Week_02_Assignment_02
Week_03_Assignment_03Week_03_Assignment_03
Week_04_Assignment_04Week_04_Assignment_04
Week_05_Assignment_05Week_05_Assignment_05
Week_06_Assignment_06Week_06_Assignment_06
Week_07_Assignment_07Week_07_Assignment_07
Week_08_Assignment_08Week_08_Assignment_08
Week_09_Assignment_09Week_09_Assignment_09
Week_10_Assignment_10Week_10_Assignment_10
Week_11_Assignment_11Week_11_Assignment_11
Week_12_Assignment_12Week_12_Assignment_12


Sl.No Chapter Name MP4 Download Transcript Download
1Lec 1: Boolean FunctionsDownloadPDF unavailable
2Lec 2: Propositional Calculus: IntroductionDownloadPDF unavailable
3Lec 3: First Order Logic: IntroductionDownloadPDF unavailable
4Lec 4: First Order Logic: Introduction (Cont'd)DownloadPDF unavailable
5Lec 5: Proof System for PropcalDownloadPDF unavailable
6Lec 6: First Order Logic: wffs, interpretations, modelsDownloadPDF unavailable
7Lec 7: Soundness and Completeness of the First Order Proof SystemDownloadPDF unavailable
8Lec 8: Sets, Relations, FunctionsDownloadPDF unavailable
9Lec 9: Functions, Embedding of the theories of naturals numbers and integers in Set TheoryDownloadPDF unavailable
10Lec 10: Embedding of the theories of integers and rational numbers in Set Theory; Countable SetsDownloadPDF unavailable
11Lec 11: Introduction to graph theoryDownloadPDF unavailable
12Lec 12: Trees, Cycles , Graph coloringDownloadPDF unavailable
13Lec 13: Bipartitie GraphsDownloadPDF unavailable
14Lec 14: Bipartitie Graphs; Edge Coloring and MatchingDownloadPDF unavailable
15Lec 15: Planar GraphsDownloadPDF unavailable
16Lec 16: Graph Searching; BFS and DFSDownloadPDF unavailable
17Lec 17: Network FlowsDownloadPDF unavailable
18Lec 18: Counting Spanning Trees in Complete GraphsDownloadPDF unavailable
19Lec 19: Embedding of the theory of ral numbers in Set Theory; ParadoxesDownloadPDF unavailable
20Lec 20: ZF Axiomatization of Set TheoryDownloadPDF unavailable
21Lec 21: Partially ordering relationsDownloadPDF unavailable
22Lec 22: Natural numbers, divisorsDownloadPDF unavailable
23Lec 23: LatticesDownloadPDF unavailable
24Lec 24: GCD, Euclid's AlgorithmDownloadPDF unavailable
25Lec 25: Prime numbersDownloadPDF unavailable
26Lec 26: CongruencesDownloadPDF unavailable
27Lec 27: Pigeon Hole PrincipleDownloadPDF unavailable
28Lec 28: Stirling Numbers, Bell NumbersDownloadPDF unavailable
29Lec 29: Generating FunctionsDownloadPDF unavailable
30Lec 30: Product of Generating FunctionsDownloadPDF unavailable
31Lec 31: Composition of Generating FunctionDownloadPDF unavailable
32Lec 32: Principle of Inclusion ExclusionDownloadPDF unavailable
33Lec 33: Rook placement problemDownloadPDF unavailable
34Lec 34: Solution of CongruencesDownloadPDF unavailable
35Lec 35: Chinese Remainder TheoremDownloadPDF unavailable
36Lec 36: Totient; Congruences; Floor and Ceiling FunctionsDownloadPDF unavailable
37Lec 37: Introduction to GroupsDownloadPDF unavailable
38Lec 38: Modular Arithmetic and GroupsDownloadPDF unavailable
39Lec 39: Dihedral Groups, IsomorhphismsDownloadPDF unavailable
40Lec 40: Cyclic groups, Direct Products, SubgroupsDownloadPDF unavailable
41Lec 41: Cosets, Lagrange's theoremDownloadPDF unavailable
42Lec 42: Rings and FieldsDownloadPDF unavailable
43Lec 43: Construction of Finite FieldsDownloadPDF unavailable