Scribd
Upload
42 views1 page

CSCE 312 Computer Organization Homework #1: (Due: 1/30, Total: 100pts)

This document outlines the homework assignments for CSCE 312 Computer Organization. The homework involves 8 problems worth a total of 100 points. The problems include converting English statements to Boolean equations, evaluating Boolean equations for given variable values, converting equations to gate-level circuits, manipulating Boolean equations, designing a decoder and multiplexer circuit using logic gates, and creating a circuit to detect an odd number of 1s on inputs using XOR gates.

Uploaded by

reyounited
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
42 views1 page

CSCE 312 Computer Organization Homework #1: (Due: 1/30, Total: 100pts)

This document outlines the homework assignments for CSCE 312 Computer Organization. The homework involves 8 problems worth a total of 100 points. The problems include converting English statements to Boolean equations, evaluating Boolean equations for given variable values, converting equations to gate-level circuits, manipulating Boolean equations, designing a decoder and multiplexer circuit using logic gates, and creating a circuit to detect an odd number of 1s on inputs using XOR gates.

Uploaded by

reyounited
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/ 1

CSCE 312 Computer Organization

Homework #1
(Due: 1/30, Total: 100pts)
1. Convert the following English problem statements to Boolean equations. Introduce Boolean variables
as needed. (10 pts)
(a) A flood detector should turn on a pump if water is detected and the system is set to enable.
(b) A house energy monitor should sound an alarm if it is night and light is detected inside a room but
motion is not detected.
2. Evaluate the Boolean equation F = (a AND b) OR c OR d for the given values of variables a, b, c, and d:
(10 pts)
(a) a = 1, b = 1, c = 1, d = 0
(b) a = 0, b = 1, c = 1, d = 0
3. Convert each of the following equations directly to gate-level circuits. (10 pts)
(a) F = ab + bc + c
(b) F = ((a + b) * (c + d)) + (c + d + e)
4. Use algebraic manipulation to convert the following equations to sum-of-products forms. (15 pts)
(a) F = a (b + c) (d) + a c (b + d)
(b) F = a b (c + d) + a (b + c) + a (b + d) c
5. Convert the following Boolean equations to canonical sum-of-minterms form: (15 pts)
(a) F(a, b, c) = abc + ab
(b) F(a, b, c) = c
6. Design a 3x8 decoder using AND, OR, and NOT gates. (15 pts)
7. Design an 8x1 multiplexer using AND, OR, and NOT gates. (15 pts)
8. Use 2-input XOR gates to create a circuit that outputs a 1 when the number of 1s on inputs a, b, c, d is
odd. (10 pts)

You might also like