Scribd
Upload
141 views3 pages

Assgn CS 1105 U1

Assignment for computer science

Uploaded by

gpplhasan2
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
141 views3 pages

Assgn CS 1105 U1

Assignment for computer science

Uploaded by

gpplhasan2
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/ 3

Assignment Unit 1

Department of Computer Science, University of the People


CS 1105: Digital Electronics and Computer Architecture
Dr. Mahmoud Mohanna
September 10, 2024
2

Solution
Step-by-Step Solution:

1. Identification of Input and Output Signals

● Input:
○ The input signal will be the state of the switch (S). The switch can have two states:
■ Closed (ON) = 1
■ Open (OFF) = 0
● Output:
○ The output will be the state of the light bulb (L), which can also have two states:
■ ON = 1
■ OFF = 0

Thus, we have one input variable (S) and one output variable (L) (Brown & Vranesic, 2013).

2. Application of Boolean Algebra Laws

To meet the requirement that the light bulb turns on when the switch is ON (closed) and turns off
when the switch is OFF (open), we can directly map the Boolean equation for the output as follows:

L=SL = SL=S

This Boolean equation indicates that the light's state is identical to the switch's state (Mano &
Ciletti, 2017) This is a simple direct relationship, where the state of the light bulb is directly
controlled by the state of the switch. When S=1 (switch closed), the light turns on, and when S=0
(switch open), the light turns off.

3. Logic Gate Selection

To implement this Boolean expression with logic gates, we can use a buffer gate, which outputs
the same signal as the input. The buffer gate is efficient because it directly passes the input signal
(S) to the output (L) without alteration (Mano & Ciletti, 2017).

The circuit design is as follows:

● Input (Switch, S) Buffer Gate Output (Light, L)

This design meets the requirement with the fewest possible logic gates (just one buffer).

4. Depiction of the Final Circuit


3

The final digital circuit can be represented as follows:

● Input (Switch, S) Buffer Gate Output (Light, L)

Here’s a simple logic gate diagram:

S ----> Buffer ----> L

Where:

● S is the switch (input).


● L is the light (output).
● The buffer gate passes the signal from S directly to L, ensuring that the light bulb is ON
when the switch is ON, and OFF when the switch is OFF.

5. Conclusion and Justification

In this assignment, we have successfully designed a simple and efficient circuit to control a light
bulb using Boolean algebra and logic gates. By analyzing the problem, we identified that the direct
Boolean equation L=S fulfills the conditions of the light bulb being on when the switch is closed
and off when the switch is open. To minimize the number of components, we utilized a single
buffer gate to implement the circuit, ensuring simplicity and efficiency.

This design is optimal because it uses the fewest possible logic gates (only one buffer) while
maintaining the desired functionality.

Reference
● Brown, S., & Vranesic, Z. (2013). Fundamentals of Digital Logic with Verilog Design.
McGraw-Hill.
● Mano, M., & Ciletti, M. (2017). Digital Design: With an Introduction to the Verilog HDL,
VHDL, and SystemVerilog. Pearson.

--End Of Assignment--

You might also like