Discussion
A Karnaugh map is used to
Answer: C
Correct answer: simplify Boolean expressions
A Karnaugh map is a graphical method of minimising a Boolean expression. It arranges the cells of a truth table so that any two adjacent cells differ in exactly one variable, which lets a redundant variable be spotted and cancelled by grouping. That adjacency is achieved by labelling the axes in Gray code - 00, 01, 11, 10 rather than 00, 01, 10, 11 - and the map wraps at its edges, so the leftmost and rightmost columns are also adjacent. Groups must contain a power of two cells: 1, 2, 4, 8. Each doubling of a group removes one variable from the resulting term, so the aim is to cover every 1 with as few and as large groups as possible. Overlapping is allowed. Cells marked as don’t care may be treated as 1 or 0, whichever makes the groups larger. The map is practical up to four variables; beyond that the Quine–McCluskey algorithm is used instead.
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development