Practice Problems

• Refer to this diagram. Analyze it like we did with the other diagram of N and P-type transistors, and make a truth-table. What is it?
• In class, we had a truth table with values like these:
  

  a	b	c	|	f
  ---	---	---	---	---
  0	0	0	|	1
  0	0	1	|	0
  0	1	0	|	1
  0	1	1	|	1
  1	0	0	|	1
  1	0	1	|	0
  1	1	0	|	0
  1	1	1	|	1

  
  
  1. Draw it using AND, OR, and NOT gates, like we did in class.
  2. Suppose that you are going to use ICs to do function f, but you only have 2-input ANDs and 2-input ORs available. How would your logic diagram change?
  3. What is the (unsimplified) Boolean algebra expression for f?
  4. Realizing that something in the form xyz + xyz', can be simplified to xy (z + z') then xy (1) then xy, how would you represent the Boolean expression differently?
• Suppose that we have a logic diagram like the following:
  
  1. What is the Boolean expression for this function?
  2. What is the truth table for this function?
  3. How would this diagram be if you convert all gates to 2 input NANDs?
• Given the Boolean expression
  g = x'y + y'z + xyz,
  how would you connect the following ICs 7404, 7408, and 7432, to make function g? Hint: each data-sheet has a pin-out drawing that represents how it would appear in a bread-board. Copy each drawing that you need as many times as you need it, then draw the connections. Label the inputs and label the output(s).