Discrete Mathematics Complete Course

Discover how boolean algebra forms lattices with binary operations, complement, and identity elements 0 and 1, obeying commutative, associative, and distributive laws, including finite boolean algebras and diagrams.

Explore core boolean identities in basic boolean algebra, including double complement, contradiction, tautology, commutativity, associativity, distributive, absorption, identity and zero elements, Morgan's law, and use of truth tables.

Explore boolean forms, compute the complement of boolean expressions with De Morgan's laws, and see how multiple representations express the same function in boolean algebra.

Derive the sum of products canonical form from a boolean function by analyzing its truth table, identifying true input combinations, and applying complements.

Explain how to obtain the product of sums canonical form from a truth table using complements and short notation. Show how inputs and outputs map to a pos expression.

Minimize boolean functions using Karnaugh maps and boolean algebra, converting complex expressions into minimal forms through systematic simplification and identifying complements for efficient logic design.

Defines graphs as a set of vertices connected by edges, drawn without arrows to form undirected graphs. Explains walks as sequences of edges and distinguishes open walks from closed walks.

Identify graph types, including simple graphs and graphs with loops on vertices. Note fat edges, pseudo graphs, null graphs, and finite graphs described in the lecture.

Explore circuits and cycles in graphs, distinguishing open and closed walks, and analyze vertex degree, including maximum and minimum degrees, with examples.

Explore connected and disconnected graphs, define complete graphs where every pair of vertices is connected by a unique edge, and introduce graph coloring concepts and minimum colors.

Explore bipartite graphs and complete bipartite graphs, identifying two vertex sets and how every vertex in one set connects to all vertices in the other.

Explore planar graphs by learning how to draw a graph in a plane with no edge crossings, identifying planar versus nonplanar graphs through clear examples.

Explore Euler's formula for planar connected graphs, V - E + F = 2, proven by induction on the number of edges, using edge removal and subgraph reasoning.

The lecture introduces graph coloring and the chromatic number, the minimum colors needed to color a graph so adjacent vertices differ, with examples like complete bipartite graphs and cycles.

In this lecture, the five color theorem for planar graphs is explained using a minimal counterexample and coloring arguments, showing every planar graph can be colored with five colors.

Explore cut sets, vertex cuts, and cut edges in graphs, showing how removing vertices or edges can disconnect a connected graph and reveal bridges.

Explore spanning trees and minimum spanning trees in graphs, including how a spanning tree connects all vertices without cycles and how a minimum spanning tree minimizes total edge weight.

Explore how edges determine connected graphs and how removing an edge affects connectivity, using induction on subgraphs and insights related to Prim's and Kruskal's algorithms.

learn how to determine connectivity in graphs, distinguish edge connectivity and vertex connectivity, and identify how removing edges can disconnect a graph while exploring related bounds and examples.

Explore matrix representation of graphs by constructing incidence matrices from a given graph, defining edges and vertices, and assigning one or zero entries accordingly.

Explore directed graphs, defining in-degree and out-degree of a vertex, with D-plus and D-minus notations, sources and sinks, and example analysis of how degrees relate.