Difference between revisions of "CSC103 Homework 2 Fall 2012"

From dftwiki3
Jump to: navigation, search
(→‎Problem #1: A majority voter circuit)
 
(14 intermediate revisions by the same user not shown)
Line 2: Line 2:
 
----
 
----
 
<bluebox>
 
<bluebox>
−
This homework is due on 10/4/12 at 9:00 a.m.  
+
 
 +
This homework is due on 10/4/12 at 9:00 a.m. 
 +
If you did the lab with a partner during the lab on Thursday, then you can submit one assignment with two names on it.  Otherwise, please do the homework by yourself.
 
</bluebox>
 
</bluebox>
  
−
__TOC__
+
__NOTOC__
  
 
=Problem #1: A majority voter circuit=
 
=Problem #1: A majority voter circuit=
Line 14: Line 16:
  
  
−
{| style="border-collapse: separate; border-spacing: 0; border-width: 1px; border-style: solid; border-color: #000; padding: 0"
+
{| class="wikitable"
−
! style="border-style: solid; border-width: 0"| a
+
!colspan="3" | inputs
−
! style="border-style: solid; border-width: 0"| b
+
! output
−
! style="border-style: solid; border-width: 0"| c
+
|-
−
! style="border-style: solid; border-width: 0"| y
+
! a
−
|- style="border-collapse: separate; border-spacing: 0; border-width: 1px; border-style: solid; border-color: #000; padding: 0"
+
! b
−
| style="border-style: solid; border-width: 0"| 0
+
! c
−
| style="border-style: solid; border-width: 0"| 0
+
! y
−
| style="border-style: solid; border-width: 0"| 0
+
|-
−
| style="border-style: solid; border-width: 0"| 0
+
| 0
 +
| 0
 +
| 0
 +
|<center>0</center>
 +
|-
 +
| 0
 +
| 0
 +
| 1
 +
| <center>0 </center>
 +
|-
 +
| 0
 +
| 1
 +
| 0
 +
|<center>0</center>
 +
|-
 +
| 0
 +
| 1
 +
| 1
 +
| <center>1</center>
 +
|-
 +
| 1
 +
| 0
 +
| 0
 +
| <center>0</center> 
 +
|-
 +
| 1
 +
| 0
 +
| 1
 +
| <center>1</center>
 +
|-
 +
| 1
 +
| 1
 +
| 0
 +
| <center>1</center>
 +
|-
 +
| 1
 +
| 1
 +
| 1
 +
|<center>1</center>
 
|}
 
|}
 +
 +
 +
 +
;Question 1
 +
: What is the boolean expression for y?  Express it as a follows:
 +
 +
    y =  (  (not a ) and ...
 +
 +
:and fill up the rest with '''not''', '''and''', '''or''', '''a''', '''b''', and '''c.'''
 +
 +
 +
;Question 2
 +
 +
:Convert your expression into a circuit containing logic gates.  Draw it by hand (or with a computer drawing program, if you prefer).  Yes, please draw it by hand on a piece of paper.  Question 3 will ask you to transpose it into the simulator, but I want to see how you translate the logic expression into a series of gates connected by wires.  I understand that it is a skill to draw esthetically pleasing schematics, so I put a page with examples of schematics to help you better organize your design.  Pleaser refer to [[CSC103 Examples of Schematics with Logic Gates |  this page for examples of schematics.]]
 +
 +
 +
;Question 3
 +
 +
:Implement your circuit with the logic gate simulator we used in the lab on 9/27/12.  Verify that your circuit behaves according to the truth table given above.
 +
 +
: Make a screen copy of your simulator window showing all the gates and the wiring, print it, and submit it with your homework.  Below is an example of the type of image I would like you to submit:
 +
<br /><br />
 +
<center>
 +
[[Image:ExampleOfGateSimulator.png|700px]]
 +
</center>
 +
 +
<br />
 +
==Reference==
 +
You may find these links useful for figuring out how to  capture the simulator window:
 +
 +
 +
* http://windows.microsoft.com/en-US/windows-vista/Use-Snipping-Tool-to-capture-screen-shots
 +
 +
* http://www.themaclawyer.com/2006/11/mac-os-x/how-to-capture-all-or-part-of-your-screen/
 +
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
[[Category:CSC103]][[Category:Homework]]

Latest revision as of 17:27, 3 October 2012

--D. Thiebaut 06:13, 27 September 2012 (EDT)

This homework is due on 10/4/12 at 9:00 a.m. If you did the lab with a partner during the lab on Thursday, then you can submit one assignment with two names on it. Otherwise, please do the homework by yourself.


Problem #1: A majority voter circuit

One circuit that is often found inside computing system is a majority voter. A majority voter is a circuit made of AND, OR and NOT gates that has 3 inputs and one output. The output is always the representation of the majority of the inputs. For example, if two or more of the inputs are 0, then the output is 0. If two or more of the inputs are 1, then the output is 1.

The truth table for such a circuit is shown below. the symbols a, b, and c represent input signals, while y is the output.


inputs output
a b c y
0 0 0
0
0 0 1
0
0 1 0
0
0 1 1
1
1 0 0
0
1 0 1
1
1 1 0
1
1 1 1
1


Question 1
What is the boolean expression for y? Express it as a follows:
   y =  (  (not a ) and ...
and fill up the rest with not, and, or, a, b, and c.


Question 2
Convert your expression into a circuit containing logic gates. Draw it by hand (or with a computer drawing program, if you prefer). Yes, please draw it by hand on a piece of paper. Question 3 will ask you to transpose it into the simulator, but I want to see how you translate the logic expression into a series of gates connected by wires. I understand that it is a skill to draw esthetically pleasing schematics, so I put a page with examples of schematics to help you better organize your design. Pleaser refer to this page for examples of schematics.


Question 3
Implement your circuit with the logic gate simulator we used in the lab on 9/27/12. Verify that your circuit behaves according to the truth table given above.
Make a screen copy of your simulator window showing all the gates and the wiring, print it, and submit it with your homework. Below is an example of the type of image I would like you to submit:



ExampleOfGateSimulator.png


Reference

You may find these links useful for figuring out how to capture the simulator window:










Retrieved from "http://dominiquethiebaut.com/dftwiki3/index.php?title=CSC103_Homework_2_Fall_2012&oldid=15334"