This is the best explanation i have seen.Thank you so much for this.

How do we subscribe 😢😢😢😢😢

We love you ❤

zaberdast🎉🎉🎉🎉🎉🎉🎉🎉🎉🎉🎉❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤😂

Our teacher made us play to study and imagen

Thank you so much. I was actually looking for this. Nobody explained me properly how k map actually works

Thnx,it was great✨

Our teacher used this video in class

3:43 why did u skip the wrap around group.

Boolean functions in Cryptology can be studied by considering their various representations including Truth Table, Algebraic Normal Form and Walsh Spectrum. The Truth Table is a list of bits giving the output for every input. n input variables require 2^n outputs. For convenience pack them into an array of unsigned 64-bit integers. The ANF is a formula using only AND and XOR. This makes the ANF representation formula unique. There is a DUALITY property between TT and ANF since the matrix operation that switched between these two forms is its own inverse. The Walsh spectrum is a list of 2^n signed integers obtained by applying a Fourier Transform to a truth table. For convenience we use the polarity truth table {-1,1} instead of the binary truth table {1,0} so that the Walsh spectrum value at position W is directly proportional to the correlation that the Boolean function has with the Linear function designated by W which is denoted by L_w(x). Correlation with linear functions is vital in Cryptology since there exist strong attacks on ciphers which employ functions that are too close to linear. There is a class of Boolean functions that achieve the maximum possible distance from linear functions, and these are called the Bent functions. When the polarity (+ve or -ve) of the Walsh spectrum of a Bent function is considered, it is also a Bent function, and so this is the DUAL Bent function. ... etc...etc...

Thank you for helping me with my computer

thanks love from kerala as a BCA student❤️

Thank you mam.

Thanks very much

Using this so i can convince my parents to buy me a pc 🖥

At the min 4:45 after taking the 2s compliment why you again add 1 ???

Today is my exam at 10 15 and iam watching in 9 o clock

Thanks for this beautiful explanation

the video is fake

Can we use mainframe computers to do work and mini computers as a memory

Thank you helped me in my computer project

Literally the best video on yt related to this topic. Thankyou soo much ma'am for your efforts. We really appreciate you

Hello dear, welcome to you.

Miss badhiya ❤

L

Keep it up😍😍😍

Thank you

Very impressive clip that simplifies long lecture within few minutes.

Wow this helps me in my revision short and clear

superb job well expalnation about cpu thnks

Good teacher

Thank you

Thank you mam ❤

❤wow

thank you

THANKYOU SOOO MUCH OMG I HAVE BEEN STRUGGLING TO FIND A CLEAR EXPLANATION😢😢🙏🙏

0:50 fake m@+#@& f=×#!=@ computers

Thanks for good information❤

thank you madam

Thank you!!

3:15 I don't understand it

❤❤❤

❤️❤️❤️ 0:15

Can u pair cell 2 and 8

Thank you so much ma' am

Tq mam❤

Good

Amazing video appreciated

Tq sir

❤❤