Computer-Science-A-level-Ocr
-
3-3-networks8 主题
-
3-2-databases7 主题
-
3-1-compression-encryption-and-hashing4 主题
-
2-5-object-oriented-languages7 主题
-
2-4-types-of-programming-language4 主题
-
2-3-software-development5 主题
-
2-2-applications-generation6 主题
-
2-1-systems-software8 主题
-
1-3-input-output-and-storage2 主题
-
1-2-types-of-processor3 主题
-
1-1-structure-and-function-of-the-processor1 主题
-
structuring-your-responses3 主题
-
the-exam-papers2 主题
-
8-2-algorithms-for-the-main-data-structures4 主题
-
8-1-algorithms10 主题
-
7-2-computational-methods11 主题
-
7-1-programming-techniques14 主题
-
capturing-selecting-managing-and-exchanging-data
-
entity-relationship-diagrams
-
data-normalisation
-
relational-databases
-
hashing
-
symmetric-vs-asymmetric-encryption
-
run-length-encoding-and-dictionary-coding
-
lossy-and-lossless-compression
-
polymorphism-oop
-
encapsulation-oop
-
inheritance-oop
-
attributes-oop
-
methods-oop
-
objects-oop
-
capturing-selecting-managing-and-exchanging-data
-
6-5-thinking-concurrently2 主题
-
6-4-thinking-logically2 主题
-
6-3-thinking-procedurally3 主题
-
6-2-thinking-ahead1 主题
-
6-1-thinking-abstractly3 主题
-
5-2-moral-and-ethical-issues9 主题
-
5-1-computing-related-legislation4 主题
-
4-3-boolean-algebra5 主题
-
4-2-data-structures10 主题
-
4-1-data-types9 主题
-
3-4-web-technologies16 主题
-
environmental-effects
-
automated-decision-making
-
computers-in-the-workforce
-
layout-colour-paradigms-and-character-sets
-
piracy-and-offensive-communications
-
analysing-personal-information
-
monitoring-behaviour
-
censorship-and-the-internet
-
artificial-intelligence
-
the-regulation-of-investigatory-powers-act-2000
-
the-copyright-design-and-patents-act-1988
-
the-computer-misuse-act-1990
-
the-data-protection-act-1998
-
adder-circuits
-
flip-flop-circuits
-
simplifying-boolean-algebra
-
environmental-effects
karnaugh-maps
Karnaugh Maps
What is a Karnaugh map?
-
In A Level Computer Science, a Karnaugh map is a tool that is used for simplifying Boolean algebra expressions
-
It offers a visual method of grouping together expressions with common factors
-
The format of the map makes it easy to identify and eliminate redundant terms
-
They are used in digital logic design, such as simplifying the logic of digital circuits
Steps:
-
Create the Map: Each cell in the grid corresponds to a term in the Boolean expression. Fill cells with 1s and 0s corresponding to the output of that term
-
Grouping: Group the 1s in the grid. Each group must be a rectangle and the size of the group must be a power of 2. A cell can be part of multiple groups
-
Simplifying: Write down a simplified Boolean expression for each group. The simplified expression for a group consists of the variables that remain constant in all terms in the group
-
Final Expression: Combine the simplified expressions from each group using OR operations to get the final simplified Boolean expression
Creating Karnaugh Maps
-
A Karnaugh Map (KMap) can be used to simplify a Boolean expression with 2 inputs
-
Here is an example for the expression A V B (A OR B)
Step 1
-
Add each variable starting with A at the top and B down the side
-
Add each possible state for A and B

Step 2
-
Take each expression in turn separated by the V (OR)
-
First look at A on it’s own
-
Find all cells where A is 1
-
Add 1 to the cell

Step 3
-
Repeat for B

Step 4
-
This is now a completed KMap for the expression A V B (A OR B)

Simplifying Expressions Using Karnaugh Maps
Simplify ¬A^¬B^C v ¬A^B^¬C v A^¬B^C v A^B using a KMap.
In this example there will be 3 variables A,B and C so the empty KMap will look like this:

Step 1:
Split this long term at each OR giving 4 smaller expressions (subterms) to add to the table:
-
¬A^¬B^C
-
¬A^B^¬C
-
A^¬B^C
-
A^B
Step 2:
-
Take the first subterm ¬A^¬B^C
-
Put a 1 in the map for every cell where this term would be TRUE (1)
-
So if A and B were 0 and C was 1 this subterm would be 1
-
So put a 1 in every cell in the KMap where A is 0, B is 0 and C is 1

Step 3:
-
The next subterm is ¬A^B^¬C
-
Put a 1 in the KMap where A is 0, B is 1 and C is 0

Step 4:
-
The next subterm is A^¬B^C
-
Put a 1 in the KMap where A is 1, B is 0 and C is 1

Step 5:
-
The final subterm is A^B
-
Put a 1 in the KMap where A is 1 and B is 1 (2 cells this time)
Responses