- Видео 50
- Просмотров 632 213
CSPictorial
Индия
Добавлен 19 июл 2020
CSPictorial aims at learning computer science in a pictorial way. This channel will provide computer tutorials to make students understand computer concepts in a simple way. CSPictorial will cover concepts ranging from basics to advanced level.
Self-Dual Boolean Functions | (Explained with solved examples)
Boolean Algebra: ruclips.net/video/UZtWgDADr1o/видео.html
Laws of Boolean Algebra: ruclips.net/video/hVc8b4ePoFQ/видео.html
Simplification of Boolean expressions: ruclips.net/video/j7Qkrm1YJ0c/видео.html
A Boolean expression is a logical statement that can either be TRUE or FALSE.
The complement of a Boolean expression is the negation of the variables with the replacement of ANDs with ORs and vice versa.
If F = (A + B)(C + D). The complement F’ = A’B’ +C’D’
The dual of a Boolean function is derived by Replacing ANDs with ORs and vice versa. Switching identity elements 0s to 1s and vice versa.
Always remember, for duality, the variables or literals will remain as such. You should never change th...
Laws of Boolean Algebra: ruclips.net/video/hVc8b4ePoFQ/видео.html
Simplification of Boolean expressions: ruclips.net/video/j7Qkrm1YJ0c/видео.html
A Boolean expression is a logical statement that can either be TRUE or FALSE.
The complement of a Boolean expression is the negation of the variables with the replacement of ANDs with ORs and vice versa.
If F = (A + B)(C + D). The complement F’ = A’B’ +C’D’
The dual of a Boolean function is derived by Replacing ANDs with ORs and vice versa. Switching identity elements 0s to 1s and vice versa.
Always remember, for duality, the variables or literals will remain as such. You should never change th...
Просмотров: 55
Видео
Sample problems| Canonical |Standard| SOP| POS
Просмотров 1133 месяца назад
This video gives you sample problems related to Canonical and standard SOP and POS forms with simple step by step solutions. These type of conversion problems can surely be expected in competitive exams. Canonical and Standard form of SOP (with examples): ruclips.net/video/-VlAtQl3qwo/видео.html Canonical and Standard form of POS (with examples): ruclips.net/video/1tXz4Mdh6j0/видео.html This vi...
Canonical and Standard form of POS (with examples)
Просмотров 6843 месяца назад
This video is about the Canonical and Standard forms of POS Boolean expressions. A Boolean expression is a logical statement that can either be TRUE or FALSE. Examples of Boolean expressions are: A BC; AB AB' A'B; (A B)(B C)(A B') Every Boolean expression can be represented in two forms: SOP form or POS form. Boolean Algebra playlist: ruclips.net/p/PLmX-4JIvNy3HytNDD_LbjGFp7q3r-LYHY Canonical a...
Canonical and Standard form of SOP (with examples)
Просмотров 7554 месяца назад
This video is about the Canonical and Standard forms of SOP Boolean expressions. A Boolean expression is a logical statement that can either be TRUE or FALSE. Examples of Boolean expressions are: A BC; AB AB' A'B; (A B)(B C)(A B') Every Boolean expression can be represented in two forms: SOP form or POS form. Boolean Algebra playlist: ruclips.net/p/PLmX-4JIvNy3HytNDD_LbjGFp7q3r-LYHY SOP Boolean...
Don't Care Condition in K-Map | (Solved Examples)
Просмотров 3508 месяцев назад
In K-Map, the don’t care conditions allow us to replace the empty cell of a K-Map to form larger group of cells. A “Don’t-Care’’ cell is represented as “X”. While forming groups of cells, “Don’t Care” cell can be treated as 1 or 0 or that cell can even be ignored. Karnaugh Map introduction: ruclips.net/video/a1Zwqjw_sp0/видео.html K-Map Simplification Procedure: ruclips.net/video/GpPshBH4FEo/ви...
Boolean Simplification using K-Map (Step-by-Step)
Просмотров 4179 месяцев назад
This video explains the K-Map simplification procedure step by step if the given Boolean function is in SOP form and in POS form. Karnaugh Map Introduction: ruclips.net/video/a1Zwqjw_sp0/видео.html Boolean Simplification using Boolean laws: ruclips.net/video/j7Qkrm1YJ0c/видео.html K-Map Rules for grouping of cells: ruclips.net/video/u2ExFST7K-k/видео.html K-Map Simplification in SOP form Step 1...
Karnaugh Map Simplification Rules | Grouping Cells
Просмотров 18 тыс.9 месяцев назад
Karnaugh Map is the method used to minimize and simplify the Boolean functions. It works on the basis of complement laws: X X’ = 1 and X.X’ =0. Thereby, to cancel a variable in K-Map, we need pairs of variables and their complements which is done by grouping. K-Map uses some rules for grouping of adjacent cells. In this video, we will check out simple explanation for these rules, one by one. Ka...
Karnaugh Map | Introduction (Basic)
Просмотров 31810 месяцев назад
Karnaugh Map is a tabular structure used to minimize and simplify the Boolean functions. For an n variable K-map, there are 2n cells. K-Map key terms: 1. Minterms, 2. Maxterms, 3. SOP Form, 4. POS Form Types of K-Map: 1. Two-variable K-Map 2. Three-variable K-Map 3. Four-variable K-Map 4. Five-variable K-Map, etc. Karnaugh map approach may be applied for any number generally it is used up to si...
Simplification Of Boolean Expressions | Using Laws of Boolean Algebra
Просмотров 1,3 тыс.Год назад
This video is about the simplification of Boolean expressions using Boolean laws. This video covers 15 examples of Boolean expression simplification of which many are solved examples from previous NET and GATE question papers. The main aim of simplifying Boolean expressions is to obtain a final logical expression that has the minimum number of terms and thereby requires minimum number of logic ...
It's all about CSPictorial | Channel Trailer
Просмотров 468Год назад
It's all about CSPictorial | Channel Trailer
Interesting facts about Computers and Technology
Просмотров 559Год назад
Interesting facts about Computers and Technology
Computer Abbreviations | Part - II (From I - Z)
Просмотров 5162 года назад
Computer Abbreviations | Part - II (From I - Z)
Computer Abbreviations | Part - I (From A - H)
Просмотров 1,5 тыс.2 года назад
Computer Abbreviations | Part - I (From A - H)
MCQs on MS-Office | Computer Awareness| (50 Questions)
Просмотров 2503 года назад
MCQs on MS-Office | Computer Awareness| (50 Questions)
Boolean Algebra | (Simple introduction)
Просмотров 8094 года назад
Boolean Algebra | (Simple introduction)
MCQs on Binary Number system | Questions from NTA-NET & GATE | (Detailed solutions)
Просмотров 8 тыс.4 года назад
MCQs on Binary Number system | Questions from NTA-NET & GATE | (Detailed solutions)
Octal to Hexadecimal | Hexadecimal to Octal | (step-by-step procedure with examples)
Просмотров 2384 года назад
Octal to Hexadecimal | Hexadecimal to Octal | (step-by-step procedure with examples)
Hexadecimal to binary | Binary to hexadecimal | Easy!!
Просмотров 974 года назад
Hexadecimal to binary | Binary to hexadecimal | Easy!!
Hexadecimal to decimal | Decimal to hexadecimal | (step-by-step procedure with examples)
Просмотров 3304 года назад
Hexadecimal to decimal | Decimal to hexadecimal | (step-by-step procedure with examples)
Octal to binary | Binary to octal | (conversions with examples)
Просмотров 2274 года назад
Octal to binary | Binary to octal | (conversions with examples)
Octal to decimal | Decimal to octal | (conversions with examples)
Просмотров 2254 года назад
Octal to decimal | Decimal to octal | (conversions with examples)
Two's complement form | Subtraction | Addition | (Examples)
Просмотров 2,1 тыс.4 года назад
Two's complement form | Subtraction | Addition | (Examples)
One's complement form | Subtraction | Addition | (Examples)
Просмотров 4,8 тыс.4 года назад
One's complement form | Subtraction | Addition | (Examples)
MCQs | Computer awareness for competitive exams | (50 questions)
Просмотров 8864 года назад
MCQs | Computer awareness for competitive exams | (50 questions)
The Central Processing Unit | (components and functions)
Просмотров 84 тыс.4 года назад
The Central Processing Unit | (components and functions)
Legends are watching it 1 day before exam
why is there a distributive law in 5:56 when there is no parenthesis??
I appreciate your interest. We apply the distributive law A + BC = (A +B)(A+C). This makes X+X'Y = (X +X')(X +Y). By this way, we could take out the term X + X'
❤❤❤❤❤❤🎉🎉🎉😮
V. V.V.V.V. good ❤❤❤🎉
❤❤
Thanks mom ❤
This is the best explanation i have seen.Thank you so much for this.
Thank you
How do we subscribe 😢😢😢😢😢
We love you ❤
zaberdast🎉🎉🎉🎉🎉🎉🎉🎉🎉🎉🎉❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤😂
Thank you
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✨
Thank you
Our teacher used this video in class
3:43 why did u skip the wrap around group.
I appreciate your interest. I skipped explaining the terms because it works the same way as other groups. That wrap around group gives the term B'C'D cancelling out A and A'.
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 ???
At that step, we are finding 2s complement = 1s complement +1
I appreciate your interest. Check the steps one more time. Hope you get it clear
Today is my exam at 10 15 and iam watching in 9 o clock
All the Best
Thanks for this beautiful explanation
the video is fake
why?
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
Thank you so much for your encouragement
Hello dear, welcome to you.
Miss badhiya ❤
Thank you
L
Keep it up😍😍😍
Thank you
Thank you
Very impressive clip that simplifies long lecture within few minutes.
Thank you for this encouraging comment
Wow this helps me in my revision short and clear
Thank you
superb job well expalnation about cpu thnks
Thank you
Good teacher
Thank you
Thank you
Thank you mam ❤
❤wow
Thank you
thank you
THANKYOU SOOO MUCH OMG I HAVE BEEN STRUGGLING TO FIND A CLEAR EXPLANATION😢😢🙏🙏
Thank You for your encouraging comment
0:50 fake m@+#@& f=×#!=@ computers
Thanks for good information❤
thank you madam
Thank you!!
3:15 I don't understand it
Watch the video from the beginning. It's easy to understand
❤❤❤
❤️❤️❤️ 0:15
Can u pair cell 2 and 8
We cannot group cells diagonally
@@cspictorial2540 thanks
Thank you so much ma' am