Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Learn discrete mathematics through comprehensive video tutorials covering fundamental topics in combinatorics, probability theory, and graph theory. Master permutations and combinations before progressing to advanced probability concepts including conditional probability and the inclusion-exclusion principle. Explore derangements and their applications in combinatorial problems. Develop expertise in generating functions through coefficient extraction, the extended binomial theorem, partial fraction decomposition, integer partitions, and combinatorial families. Study recurrence relations systematically, beginning with homogeneous relations and advancing to non-homogeneous cases, then learn to solve them using generating functions. Dive into graph theory fundamentals including subgraphs, complements, complete graphs, and graph isomorphisms. Examine bipartite graphs, vertex degrees, regular graphs, and Euler circuits and trails. Investigate planar graphs and apply Euler's theorem to solve related problems. Analyze Hamilton cycles, graph coloring techniques, and chromatic polynomials. Study tree structures, directory systems, and tree traversal algorithms. Implement Dijkstra's algorithm for shortest path problems and explore flow networks using the Edmonds-Karp algorithm for maximum flow calculations. Conclude with minimal cut problems and their practical applications in network optimization.
