Scribd
Upload
5 views

Computer assignment

The document discusses Boolean algebra concepts, including logic gates, simplification theorems, and De Morgan's theorem, which are essential for digital circuit design. It provides truth tables for AND and NOR gates, illustrating their outputs based on input conditions. Additionally, it outlines a security system framework using these principles to determine alarm outputs based on motion sensor and door states.

Uploaded by

Mukbs
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views

Computer assignment

The document discusses Boolean algebra concepts, including logic gates, simplification theorems, and De Morgan's theorem, which are essential for digital circuit design. It provides truth tables for AND and NOR gates, illustrating their outputs based on input conditions. Additionally, it outlines a security system framework using these principles to determine alarm outputs based on motion sensor and door states.

Uploaded by

Mukbs
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Computer Science assignment

Logic gates are defined in binary states i.e. open or closed state, where 1 represents an open state
and 0 represents a closed state.
For question one, let A represent the motion sensor.
Let B represent the door
Hence A=1 (Motion sensor in living room is triggered)
B=1(Front door is opened)
Question 1 b
The expressions are in their simplest form, however in case of complex situations, laws of
Boolean algebra can be used as follows
Simplification Theorem
These allow the transformation of complex Boolean expressions into simpler ones minimizing
the number of logic gates needed for implementation
A(A+B)=A
A B+A B̅ =A
(A+B)(A+ B̅ )=A
Absorption Theorem
A+A̅ *B=A+B
A(A̅ +B)=A*B
QUESTION TWO
De Morgans theorem of Boolean algebra states that the negation of a conjunction (AND) is
equivalent to the disjunction OR of the negations and the negation of a disjunction OR
equivalent to the conjunction of negations (AND).
Let S represent smoke detection in the kitchen
W represent windows are closed.
Therefore, the negation of S is NOT (Smoke is detected in the kitchen)
The negation of windows closed is NOT (Windows are closed)
Which is ͉ (S AND W) equivalent to ͉S OR ͉W.
De Morgans laws are related to other Boolean algebra laws such as
Complement Law
Seen as an extension of the complement law, which states that the complement of a complement
is the original variable i.e.(A`) `=A
Therefore, negations can be distributed across logical AND and OR operations, changing the
operation while complementing the individual term.
Simplification and transformative laws. De Morgans theorems are tools for transforming
Boolean expressions into simpler equivalent tools which is important in digital circuit design
where minimal complexity of logic gates is important.
Distributive Law. De Morgans theorems are a form of the distributive law for logic. They
describe hoe the negation of a conjunction (AND) is equivalent to a disjunction (OR) and vice
versa.
QUESTION THREE
The AND gate outputs true =1, only when both inputs are true=1.
TRUTH TABLE FOR AND GATE.
A (Motion sensor) B (Front Door) Output (A and B)
0 0 0
1 0 0
0 1 0
1 1 1
TRUTH TABLE FOR A NOR GATE
The NOR gate is a combination of OR gate followed by a NOT gate. Its outputs true=1, only
when both inputs are false. In other words, it’s the reverse of an OR gate.
Let’s consider,
Security alarm triggered=1, S=1
Disarmed =0, S=0
Windows closed, W=1
Windows open. W=0
S(Security alarm) W(Windows) Output(S NOR W)
0 0 1
0 1 0
1 0 0
1 1 0

QUESTION FOUR
Part a
In question one,
The Motion sensor is triggered and the front door is opened, this simplifies to
A*B Corresponds to the AND gate truth table in question three
The motion sensor is not triggered corresponding to A̅ OR front door closed corresponding to B̅ ,
indicates that if these conditions are taken at the same time, the output will be zero, however if
these are applied onto the NOR gate in question 3b, the output will be 1, the expression is A̅ + B̅
Part b
Algebraic manipulations
For AND, Output is 1when both inputs are 1
For NOR, output is 1only when both inputs are 0 representing a negation of the OR gate.̅̅
QUESTION FIVE
Let’s consider,
Y as the output alarm.
Case One
Motion sensor is triggered and front door opened =Output
A·B=Y1
Case two
Security alarm armed NOR windows closed=Output
S̅ +W̅ =Y2
The overall security logic can combine these outputs if either or of the two conditions are met
that is to say
Alarm=Y1+Y2= A·B + S̅ +W̅
The output of the AND gate, representing the motion sensor in the living room and front door
opened can be used as input to the NOR gate which creates a logical framework for a smart
home security system where conditions of the motion sensor and the front door trigger the
security alarm and the status of the windows affects the security alarm.

REFERENCES
https://www.studocu.com/en-us/messages/question/10411656/in-this-assignment-you-will-be-
able-to-examine-and-apply-the-basic-concepts-of-boolean-algebra-and
https://www.electronics-tutorials.ws/boolean/bool_7.html
https://www.pvpsiddhartha.ac.in/dep_it/lecture%20notes/DSD/unit2.pdf
1. Ndjountche, T. (2016). Digital electronics 1: Combinational logic circuits. John Wiley &
Sons, Incorporated. pp. 67 to pp 81

You might also like