Search for notes by fellow students, in your own course and all over the country.
Browse our notes for titles which look like what you need, you can preview any of the notes via a sample of the contents. After you're happy these are the notes you're after simply pop them into your shopping cart.
Title: Discrete Mathematical Analysis
Description: Discrete Mathematical Analysis Assessed Coursework Specification
Description: Discrete Mathematical Analysis Assessed Coursework Specification
Document Preview
Extracts from the notes are below, to see the PDF you'll receive please use the links above
Question 1
In a test of learning potential, a scientist wishes to see how quickly a rat can learn to obtain
food from a dispenser when certain combinations of coloured lights are shown
...
A rat is placed in a cage in which are three coloured lights, one red, one green and one blue
...
When certain
combinations of these lights are on, a food dispenser becomes active and the rat can obtain
food by pushing the door of the dispenser
...
It is expected that the rat will
learn to push at the dispenser only when the correct lights are on
...
All other
combinations will not provide food
...
Draw a truth table representing each light as a Boolean variable, showing all
combinations of the variables and the output A which indicates whether the dispenser
is active or not
...
Using the truth table, write down a Boolean expression that will activate the dispenser
when appropriate
...
Use a Karnaugh Map to find the simplest representation of the expression
...
Using the simplest expression, draw a circuit involving AND, OR and NOT gates which
could be used to operate the dispenser
...
Red
T
T
T
T
F
F
F
F
Green
T
T
F
F
T
T
F
F
Blue
T
F
T
F
T
F
T
F
Output A
T
T
F
F
T
T
T
F
The truth table above shows when the combinations of colour lights that will enable the
dispenser to become active or inactive,the T stands for true which means the light is on or
will provide food and false means the lights are off or will not provide food
...
2
...
rgb + rgb’ + r’gb + r’gb’ + r’g’b =gb(r+r’)+gb’(r+r’)+r’g’b
=gb
...
1+r’g’b
Output A =gb+gb’+r’g’b=>g+ r’g’b
3
...
r
g’
g
g
1
g’
1
r’
1
Region 1
1
1
Region 2
b’
b
b’
b
Above is my kirnaugh map of my Boolean expression and below is the Boolean expression
simplified by using the Karnaugh map
...
This is my switch circuit that shows how the simplified expression works
r’
r
b
g’r’b
b
g’
g
Output A=g+ g’r’b
g
A
Title: Discrete Mathematical Analysis
Description: Discrete Mathematical Analysis Assessed Coursework Specification
Description: Discrete Mathematical Analysis Assessed Coursework Specification