UGC NET CS: Discrete Structures & Optimization - Boolean Algebra (14)

@sweetyasaiyed5920 UGC NET Paper 2 Computer Science and Applications Code No.:(87) UGC NET CS Syllabus Link: https://comptechaholic.com/e-learning/ For Lecture pdf of given video e-mail at: [email protected] Subject: PDF UNIT1 TOPIC6C Lecture-12: Boolean Functions and its Representation Lecture-13: Simplifications using Algebraic Functions Lecture-13 Simplifications using Boolean Algebra Theorems Lecture-14: Simplifications using Karnaugh Maps (K-Maps) Lecture-15: Simplifications using Quine-McCluskey Method / tabulation method Unit 1: Discrete Structures and Optimization (PART: 6C/7) Boolean Algebra: Topics Covered: Simplifications of Boolean Functions using Karnaugh Maps (K-Maps) Index: Simplifications of Boolean Functions using Karnaugh Maps / K-Maps K-Map rules for the simplification of Boolean expressions (7) 5examples of Simplification of Boolean function using K-map Various Implicants in K-Map: 1) Prime Implicants (PI) 2) Redundant Prime Implicants (RPI) 3) Essential Prime Implicants (EPI) 4) Selective Prime Implicants (SPI) / non-essential prime implicants Timecode: 00:22 Simplifications of Boolean Functions using Karnaugh Maps / K-Maps 00:38 K-Map rules for the simplification of Boolean expressions (7) 02:48 examples of Simplification of Boolean function using K-map (5) 13:12 Various Implicants in K-Map