Scribd
Upload
20 views3 pages

CS 330 - Homework 2

The document outlines Homework #2 for CS 330, focusing on digital logic and number representation, with a total of 100 points due on February 29, 2024. It includes various questions related to logical expressions, circuit design, Boolean algebra, and number conversions. Students are required to submit a PDF of their written responses along with a Logisim file containing circuit diagrams.

Uploaded by

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

CS 330 - Homework 2

The document outlines Homework #2 for CS 330, focusing on digital logic and number representation, with a total of 100 points due on February 29, 2024. It includes various questions related to logical expressions, circuit design, Boolean algebra, and number conversions. Students are required to submit a PDF of their written responses along with a Logisim file containing circuit diagrams.

Uploaded by

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

CS 330 Hardware and Systems Fundamentals

Spring 2024 – Homework # 2: Digital Logic and Number Representation

Total Points: 100

Due Date: Thursday, 29th February 2024.


• Always read the associated sections of the textbook before attempting the homework problems!
• You will submit a PDF of your written responses together with a Logisim file that
contains all circuits you were asked to draw in this assignment. Differentiate the diagrams
in all sub-circuits by proper naming, labeling and/or description.

Q1. Using the following Table

A B C Y
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 1

a) Write the logical expression that indicates Y’s functional behavior. [2 marks]
b) Design a logic circuit network that realizes Y’s functional behavior. [4 marks]
c) Construct a Karnaugh map. [4 marks]
d) Using the Karnaugh map results, re-write the logical expression from part “a.” above. [3 marks]
e) Re-design the logical circuit network from “b.” above and indicate what elements have been
eliminated from the original logic circuit network. [4 marks]
f) Write the SOP and POS forms of the given truth table. For this truth table, which form is more
efficient and convenient and why? [5 marks]
1 of 3
g) Using universal gates NAND and NOR, draw the circuits that realize the logic for the SOP.
[8 marks]

Q2
a) Using Boolean algebra, show that the following two expressions are equivalent: [6 marks]
F1 = ABC + ABC + ABC + ABC
( )(
F2 = ( A + B + C ) . A + B + C . A + B + C )( A + B + C )
These two expressions represent the majority function in sum-of-products and product-of-sums form.

b) Assuming that AND, OR, NAND and NOT gates are available, sketch the combinations that would realize
the following: [8 marks]
(i) Y = A.B.C + A + ( B + C )

( )
(ii ) Z = B A + B + C + A + ( B + C )

c) For the circuit shown below, determine the relationship between the output Z and the inputs A, B and [Link] a
truth table for the function [6 marks]

d) Provide a circuit diagram that implements the following Boolean function using four inputs (A, B, C, D)
[7 marks]

(i) Implement the function above using only NAND gates. [7 marks]

2 of 3
Q3.

a) Convert each binary number to decimal, octal and hexadecimal: [14 marks]
i. 101010101110
ii. 101011000.011
iii. 10111011.1110

b) Perform each subtraction in the 2’s complement form: [5 marks]


i. 00110011 - 00010000
ii. 01100101 - 11101000

c) Perform the following binary multiplications: [5 marks]


i. 1100 * 101
ii. 1110 * 1110

d) Represent the following signed magnitude integers in 8-bit and 16-bit registers.
a. -72
b. +256
[12 marks]

3 of 3

You might also like