NTA-NET (UGC-NET) Computer Science & Applications (87) Computer Arithmetic-Logic Families Study Material (Page 7 of 11)
Choose Programs:
⏳ 🎯 Online Tests (4 Tests [100 questions each]): NTA Pattern, Analytics & Explanations
Rs. 800.00 -OR-
3 Year Validity (Multiple Devices)
Sample TestsDetailsSee Demo
🎓 Study Material (2083 Notes): 2024-2025 Syllabus
Rs. 1250.00 -OR-
3 Year Validity (Multiple Devices)
Topic-wise Notes & SampleDetails
🎯 2699 MCQs (& PYQs) with Full Explanations (2024-2025 Exam)
Rs. 600.00 -OR-
3 Year Validity (Multiple Devices)
CoverageDetailsSample Explanation
Help me Choose & Register (Watch Video) Already Subscribed?
Minimization of Boolean Functions: The Map
Edit
The Map
- The Map is basically a diagram consisting of squares. For N variables on a Karnaugh map there are 2N numbers of squares. Each square or cell represents one of the minterms. Since any Boolean function can be expressed as a sum of minterms, it is possible to recognize a Boolean function graphically in the map from the area enclosed by those squares whose minterms appear in the function.
- Further, it is also possible to derive alternative algebraic expressions or simplify the expression with a minim…
… (376 more words, 24 figures) …
Subscribe (by clicking here) to view full notes and track progress.
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.
… (383 more equations, 83 figures) …
Subscribe (by clicking here) to view full notes and track progress.