CS/ECE 252 Fall 2011

http://pages.cs.wisc.edu/~sohi/cs252/Fall2011/handouts/hwk3_sol.html

Computer Sciences Dept.

CS/ECE 252 Introduction to Computer

My UW | UW Search

Engineering
Fall 2011 Section 1 Instructor Guri Sohi TAs Newsha Ardalani and Rebecca Lam URL: http://www.cs.wisc.edu/~sohi/cs252/Fall2011/
Homework 3 // Due at lecture Mon, Sep 26 Primary contact for this homework: Rebecca Lam [rjlam@cs.wisc.edu] You must do this homework in groups of two. Please write the full name and the student id of each member on every pages and staple multiple pages together.
Problem 1 (2 points)

Computer Science Home Page Home Contact Info Lecture & Notes Schedule Computing Grading Examinations Homework

Write the decimal equivalents for these IEEE floating point numbers a. 00111111111000000000000000000000 1.75 b. 10111110110000000000000000000000 -0.375
Problem 2 (5 points)

Given the logic equation Z = A OR B OR (NOT C) a. Draw the transistor level circuit for Z Z = (A NOR B) NAND C

b. Draw the gate-level circuit for Z using a minimal number of NAND, NOT, and NOR gates

1 of 5

6/28/2012 6:08 PM

CS/ECE 252 Fall 2011

http://pages.cs.wisc.edu/~sohi/cs252/Fall2011/handouts/hwk3_sol.html

*Hint: Use DeMorgan's Law

Problem 3 (4 points)

Given the following transistor level circuit:

a. Fill out the truth table for Z

ABZ 000

2 of 5

6/28/2012 6:08 PM

CS/ECE 252 Fall 2011

http://pages.cs.wisc.edu/~sohi/cs252/Fall2011/handouts/hwk3_sol.html

011 101 111

b. What is Z in terms of A and B Z = A OR B
Problem 4 (5 points)

Given the logic equation Z = (A AND B) OR (B AND C) OR (A AND C) a. Fill out the truth table

ABCZ 0000 0010 0100 0111 1000 1011 1101 1111

b. Draw the gate-level circuit for Z using 2-input AND and OR gates

Problem 5 (4 points)

Given the logic equation Z = (A AND (NOT B)) OR ((NOT A) AND B) a. Fill out the truth table

ABZ 000 011 101 110

3 of 5

6/28/2012 6:08 PM

CS/ECE 252 Fall 2011

http://pages.cs.wisc.edu/~sohi/cs252/Fall2011/handouts/hwk3_sol.html

b. Is there a logic gate that implements this function? Give reasons for your answer. Yes, the XOR gate.
Problem 6 (2 points)

Given an address size of 10 bits with 16 bits stored at each address, what is the total size of accessible memory(in bytes)? 2048 Bytes
Problem 7 (6 points)

Given the following truth table a. Draw the gate-level circuit using NOT gates and 3-input AND and OR gates.

b. Convert the circuit of part a into a circuit that uses only NAND gates. *Hint: Use DeMorgan's Law We use DeMorgan's Law on the OR gate and get the following:

4 of 5

6/28/2012 6:08 PM

CS/ECE 252 Fall 2011

http://pages.cs.wisc.edu/~sohi/cs252/Fall2011/handouts/hwk3_sol.html

ABCZ 0000 0011 0101 0110 1001 1010 1100 1110

Problem 8 (2 points)

Using ASCII 8-bit, null-terminated string patterns, represent each of the characters in the string "Last Question!" using the hexadecimal value. (Only represent the characters between the quotation marks.) 4C 61 73 74 1 51 75 65 73 74 69 6F 6E 21 00

Computer Sciences | UW Home

Page last modified: Monday, 26-Sep-2011 11:29:23 CDT Feedback or content questions: send email to sohi@cs.wisc.edu Technical or accessibility issues: lab@cs.wisc.edu Copyright 2002, 2003 The Board of Regents of the University of Wisconsin System.

5 of 5

6/28/2012 6:08 PM