Design and Analysis of Algorithms
Comprehensive exploration of algorithm design and analysis, covering complexity, sorting, data structures, and optimization techniques for efficient problem-solving.
Basic Electronics
The course is about basic electronic circuits, both analog and digital. In the analog part, diode circuits, BJT amplifiers, Op-Amp circuits will be covered. In the digital part, combinatorial and sequential circuits will be covered.
The Ultimate Guide to Propositional Logic for Discrete Mathematics
Comprehensive guide to propositional logic in discrete mathematics, covering key concepts, truth tables, logical equivalence, and practical applications with exercises for reinforced learning.
Digital Electronic Circuits
Digital systems represent and manipulate digital signals. Such signals represent only finite number of discreet values. A signal can be discreet by nature whereas, a continuous signal can be discretized for digital processing and then converted back.
Basics of Discrete Mathematics
Explore set theory, relations, functions, counting principles, and propositional logic in this comprehensive introduction to discrete mathematics, essential for computer science and AI.
Knowledge Graphs Seminar - Spring 2020
Explore knowledge graphs through Stanford's seminar series, covering fundamental concepts, applications, and advanced topics in this cutting-edge field of data representation and reasoning.
Digital Circuits
Comprehensive exploration of digital circuits, covering number systems, Boolean algebra, logic gates, arithmetic circuits, sequential circuits, finite state machines, data converters, memory, FPGA, VHDL, and microprocessors.
Discrete Mathematics
Comprehensive exploration of discrete mathematics concepts, covering set theory, relations, group theory, and functions, ideal for exam preparation and university-level study.
Discrete Math
Explore fascinating mathematical concepts like knots, cyphers, and encryption through engaging topics such as magic squares, Pascal's triangle, and Eulerian paths.
The Bunkbed Conjecture Debunked - A Counterexample with 7222 Vertices
Explore a groundbreaking development in probabilistic graph theory in this 15-minute video by Dr. Trefor Bazett. Learn about the recent disproval of the famous bunkbed conjecture, featuring a surprising counterexample with 7,222 vertices. Delve into the…
Isoperimetric and Poincaré Inequalities on the Hamming Cube
Explore isoperimetric inequalities on the Hamming cube near and at the critical exponent 1/2, as well as closely related L1 Poincaré inequalities in this one-hour lecture. Delve into joint research conducted with P. Durcik and P. Ivanisvili, focusing on…
Analytic Insights into the Zig-Zag Product and Its Friends - Part I
Explore advanced graph theory with Gil Cohen, delving into the Zig-Zag product and related graph operators using innovative analytic techniques for more precise bounds and insights.
The Longest Mathematical Proof Ever: Exploring Schur Number Five
Dive into the world's longest mathematical proof, exploring Schur number five and its 2-petabyte size. Uncover propositional logic, SAT solvers, and proof verification in this fascinating journey.
Number Theory
Comprehensive exploration of number theory, covering foundational concepts to advanced topics like quadratic reciprocity, integer partitions, and Ramanujan's congruences.
Discrete Math II - Combinatorics
Explore advanced combinatorics, including permutations, generating functions, recurrence relations, graph theory, and algorithms, enhancing problem-solving skills in discrete mathematics.
Discrete Math I
Comprehensive exploration of discrete mathematics, covering logic, sets, functions, algorithms, number theory, induction, counting, probability, relations, and graphs with practical applications.
Special Functions - Bessels and Legendre
Comprehensive exploration of Bessel's functions and Legendre polynomials, covering recurrence relations, proofs, and applications in partial differential equations.
Series Solution
Comprehensive exploration of series solutions for differential equations, covering Legendre polynomials, Frobenius method, Bessel's functions, and partial differential equations.
The Basel Problem
Explore the fascinating Basel Problem through a step-by-step mathematical journey, covering recurrence relations, integration techniques, and the squeeze theorem.
Olympiad Level Counting - How Many Subsets of {1,…,2000} Have a Sum Divisible by 5?
Explore advanced counting techniques using generating functions and complex numbers to solve a challenging subset sum problem, with applications to Olympiad-level mathematics.
Logic Gates, Truth Tables, Boolean Algebra - AND, OR, NOT, NAND & NOR
Comprehensive introduction to digital logic fundamentals, covering gates, truth tables, and Boolean algebra. Ideal for electronics beginners and college students in logic design.