Karnaugh Maps | 4.3b | OCR A-Level Computer Science
Description: This video explains step-by-step how a Karnaugh Map is used to simplify a Boolean expression. It covers placing a complex expression into the map, grouping the bits of 1 and using the groups to identify a simplified expression.
This video is suitable for those interested in learning more about this topic, as well as students in the UK studying for the qualification below:
🎓 Course:
- Qualification: Cambridge OCR A-Level Computer Science
- Certificate: H446
- Component 1: Computer Systems
- Topic: 1.4.3 Boolean Algebra
🧷 Related:
- Cambridge OCR A-Level Topic Playlist: https://www.youtube.com/playlist?list=PLDH7mTVOS6xmgtj8v3_qkLY1cU_qrw39u
- More topics on the CSNewbs website: https://www.csnewbs.com/ocr-a-level-4-3-boolean-algebra Close description
This video is suitable for those interested in learning more about this topic, as well as students in the UK studying for the qualification below:
🎓 Course:
- Qualification: Cambridge OCR A-Level Computer Science
- Certificate: H446
- Component 1: Computer Systems
- Topic: 1.4.3 Boolean Algebra
🧷 Related:
- Cambridge OCR A-Level Topic Playlist: https://www.youtube.com/playlist?list=PLDH7mTVOS6xmgtj8v3_qkLY1cU_qrw39u
- More topics on the CSNewbs website: https://www.csnewbs.com/ocr-a-level-4-3-boolean-algebra Close description




