Boolean Algebra

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/17

encourage image

There's no tags or description

Looks like no tags are added yet.

18 Terms

1
New cards

What is a conjunction?

an AND gate that is thought of as applying multiplication to its binary inputs (A AND B =Y)

2
New cards

What is a disjunction?

An OR gate that is thought of as addition( A OR B=Y)

3
New cards

What is a Negation?

A NOT gate (NOT A =Y)

4
New cards

What is an exclusive disjunction?

An XOR gate ( A XOR B = Y)

5
New cards

Rules of simplifying an expression in a Karnaugh map?

  • Mark the rectangles with any powers of two (rectangles can wraparound or overlap).

  • For each rectangle, figure out a mini expression - these are then simplified to give a smaller equation.


6
New cards

Commutative Rule

Laws of commutation show that the order of literals around an operator does not matter

7
New cards

Double Negation

  • Double Negation - of there are two NOT / negative symbols, they cancel each other out so you can remove it.


8
New cards

Association

  • Association - adding/ removing brackets and reordering of literals in a boolean expression.


9
New cards

Distribution

Essentially expanding the brackets

A AND (B OR C) = (A AND B) OR (A AND C)

10
New cards

De Morgan’s Laws

When factoring/ expanding both terms in an expression (NOT P equates to P and NOT Q equates to Q), the AND flips to an OR and the OR flips into an AND.

11
New cards

Half-adder

(A XOR B) OR (A AND B) - sum and the carry#

  • When A and B are false = both outputs are false

  • When A or B is true = Sum is true

  • When both inputs are true = Carry is true


12
New cards

Full Adder

  • Similar to a half adder, but has an additional input that has a carry in.

  • Formed with two XOR and AND gates with one OR gate.


13
New cards

What is an Adder?

A logic circuit that adds together the number of inputs which are true and output that number in binary.

14
New cards

D-type Flip Flops

Type of logic circuit which can store that value of one bit. Has two inputs:

  • Control signal

  • Clock input (a regular pulse generated by the CPU to coordinates the computer’s components; d-type flip flop can only change at a rising edge)


15
New cards

As flip flops are a basic unit of memory, they can be combined to form what?

Registers

16
New cards

One result of full adders having a carry input.

Can be chained to form a ripple adder that connects the previous S and C -out to the next B and C -in, with a new input A.

17
New cards

D-type flip flop

Purpose is to capture, store and synchronise single bits of binary data. (An example would be an edge-trigger d-type flip flop).

18
New cards