GATE (Graduate Aptitude Test in Engineering) Computer Science & IT (CS) Set Theory & Algebra-Boolean Algebra Study Material (Page 3 of 3)

Choose Programs:

🎓 Study Material (1190 Notes): 2024-2025 Syllabus

Rs. 1000.00 -OR-

3 Year Validity (Multiple Devices)

Topic-wise Notes & SampleDetails

🎯 302 Numeric, 2894 MCQs (& PYQs) with Full Explanations (2024-2025 Exam)

Rs. 650.00 -OR-

3 Year Validity (Multiple Devices)

CoverageDetailsSample Explanation

Help me Choose & Register (Watch Video) Already Subscribed?

Minimization of Boolean Functions: Types of Groupings

Edit

Types of Groupings

  • Now we see types of groupings that we can do for a K-map, we will follow rules for this.

    1. Groups may not include any cell containing a zero. This rule has already been shown in the bottom-right diagram above.

    2. Groups may be horizontal or vertical, but they cannot be diagonal.

Continuity Across the Min-Terms
  • The grouping should have such continuity across the min-terms

    3. Each group should be as large as possible.

Two Groups of 4 1s, vs. Three Groups of 2 1s
  • On the left side, we see two groups of , while on the right we see three groups of
  • The meaning for us is that the grouping should be extended as much as possible. Fu…

… (440 more equations, 128 figures) …

Subscribe (by clicking here) to view full notes and track progress.

Special Cases of the Karnaugh Map

Edit

Special Cases of the Karnaugh Map

  • These are not elaborate rules or methods like we have seen before, these are just some peculiar cases that can help us to read the Karnaugh Map better.
  • Don՚t-care term – The don՚t-care term for a function is an input-sequence, or like a series of bits, for which the function output does not matter.…

… (613 more words, 15 figures) …

Subscribe (by clicking here) to view full notes and track progress.