Summation Formulas and Sigma Notation - Calculus

(20:24)

what is sigma notation and how to we use it

(1:22)

If I did this in 1734 I'd be World Famous

(3:57)

Using the summation symbol

(3:48)

Convergence and Divergence - Introduction to Series

(16:18)

Implement the function 𝐟(𝒂,𝒃,𝒄,𝒅)=∑(𝟎,𝟏,𝟓,𝟔,𝟕,𝟗,𝟏𝟎,𝟏𝟓) using8:1 MUX

(19:4)

how to use the ratio test for the series of n!/n^n

(8:26)

Implementation of Boolean Function using Multiplexers

(8:34)

How to Implement following Boolean function using multiplexer F(A, B, C, D)= Σ (0,2, 5, 8, 10, 14)

(10:5)

Q. 3.24: Implement the following Boolean function F, usingtwo-level forms of logic (a) NAND- AND

(15:38)

Simplify the function 𝒇(𝒂,𝒃,𝒄,𝒅)=∑𝝅𝑴(𝟎,𝟒,𝟓,𝟕,𝟖,𝟗,𝟏𝟏,𝟏𝟐,𝟏𝟑,𝟏𝟓) Using Karnaugh map

(4:37)

Implement the given function using 4:1 multiplexer. 𝑭(𝑨,𝑩,𝑪)=∑(𝟏,𝟑,𝟓,𝟔)

(10:7)

Simplify the function 𝒇(𝒂,𝒃,𝒄,𝒅)=∑𝒎(𝟐,𝟑,𝟒,𝟓,𝟏𝟑,𝟏𝟓)+𝒅𝒄(𝟖,𝟗,𝟏𝟎,𝟏𝟏) Using Karnaugh map

(3:29)

Q. 3.11: Simplify the following Boolean functions: using five variable maps: (a) F(A,B,C,D,E) = Sum

(8:52)

Q. 3.15: Simplify the following Boolean function F, together with the don’t-care conditions d, and

(9:32)

Q. 3.17: Draw a NAND logic diagram that implements the complement of the following function

(6:47)

Simplify given function using Quine-McCluskey Method (QM Method)

(24:41)

Q. 4.37: Implement the following Boolean function with a 4 * 1 multiplexer and external gates

(11:23)

Implement the function 𝐟(𝒂,𝒃,𝒄,𝒅)=∑(𝟒,𝟓,𝟕,𝟗,𝟏𝟏,𝟏𝟐,𝟏𝟑,𝟏𝟓) using 8:1 mux and 4:1 mux

(15:40)