Category:

# Discrete Mathematics

Duration: 10:00:00
Lectures: 41
Level: Beginner This course covers several important topics of Discrete Mathematics. This includes Set thoery and logic, relations, partially ordered sets, Boolean algebra
and Boolean functions, analysis of algorithms, recurrence relations, finite state machines, discrete probability and graph theory. The applications of these topics
are also discussed.

1
Discrete Mathematics -Lec :01 -Introduction to the theory of sets
56:08
2
Discrete Mathematics -Lec :02 -Set operation and laws of set operation
49:07
3
Discrete Mathematics -Lec :03 -The principle of inclusion and exclusion
47:28
4
Discrete Mathematics -Lec :04 – Application of the principle of inclusion and exclusion
55:27
5
Discrete Mathematics -Lec :05 -Fundamentals of logic
46:02
6
Discrete Mathematics -Lec :06 -Logical Inferences
43:05
7
Discrete Mathematics -Lec :07 -Methods of proof of an implication
50:26
8
Discrete Mathematics -Lec :08 -First order logic(1)
42:33
9
Discrete Mathematics -Lec :09 -First order logic(2)
43:16
10
Discrete Mathematics -Lec :10 -Rules of influence for quantified propositions
38;21
11
Discrete Mathematics -Lec :11 -Mathematical Induction(1)
43:20
12
Discrete Mathematics -Lec :12 -Mathematical Induction(2)
52:38
13
Discrete Mathematics -Lec :13 -Sample space, events
57:56
14
Discrete Mathematics -Lec :14 -Probability, conditional probability
57:56
15
Discrete Mathematics -Lec :15 -Independent events, Bayes theorem
42:47
16
Discrete Mathematics -Lec :16 -Information and mutual information
53:45
17
Discrete Mathematics -Lec :17 -Basic definition
41:35
18
Discrete Mathematics -Lec :18 -Isomorphism and sub graphs
44:00
19
Discrete Mathematics -Lec :19 -Walks, paths and circuits operations on graphs
54:47
20
Discrete Mathematics -Lec :20 -Euler graphs, Hamiltonian circuits
42:08
21
Discrete Mathematics -Lec :21 -Shortest path problem
45:41
22
Discrete Mathematics -Lec :22 -Planar graphs
41:33
23
Discrete Mathematics -Lec :23 -Basic definition.
1:05:08
24
Discrete Mathematics -Lec :24 -Properties of relations
47:29
25
Discrete Mathematics -Lec :25 -Graph of relations
49:32
26
Discrete Mathematics -Lec :26 -Matrix of relation
51:33
27
Discrete Mathematics -Lec :27 -Closure of relaton(1)
57:53
28
Discrete Mathematics -Lec :28 -Closure of relaton(2)
56:51
29
Discrete Mathematics -Lec :29 -Warshall’s algorithm
1:03:16
30
Discrete Mathematics -Lec :30 -Partially ordered relation
49:20
31
Discrete Mathematics -Lec :31 -Partially ordered sets
55:05
32
Discrete Mathematics -Lec :32 -Lattices
53:56
33
Discrete Mathematics -Lec :33 -Boolean algebra
58:41
34
Discrete Mathematics -Lec :34 -Boolean function(1)
1:02:50
35
Discrete Mathematics -Lec :35 -Boolean function(2)
57:36
36
Discrete Mathematics -Lec :36 -Discrete numeric function
1:00:35
37
Discrete Mathematics -Lec :37 -Generating function
59;25
38
Discrete Mathematics -Lec :38 -Introduction to recurrence relations
49:06
39
Discrete Mathematics -Lec :39 -Second order recurrence relation with constant coefficients(1)
50:57
40
Discrete Mathematics -Lec :40 -Second order recurrence relation with constant coefficients(2)
59:35
41
Discrete Mathematics -Lec :41 -Application of recurrence relation
55:59