Project List

1. Rock, Scissors, Paper Adjudicator

   -2 sets of 3 inputs, r,p,s

   -2 outputs o1,o2

   if a winner, o1 or o2 goes high, other low

   if no winner, both outputs are low

   if only one pressed, both outputs are low

   for any error condition, both outputs are high
   
   

2. Hex to 7 Segment Decoder

   -4 inputs

   -7 outputs

   outputs are to drive 7 segment display for any input from 0 to F.
   All digits must be unique!
   
   

3. Braille Number Encoder Circuit

   -4 inputs (binary representation of number up to 9)

   -6 outputs

   output the braille representation of the input number
   
   

4. Braille Number Decoder Circuit

   -6 inputs

   -4 outputs (binary representation of number)

   output the number of the braille input
   
   

5. Fox, Goose, Corn Solver

   -4 inputs; fox_here, goose_here, corn_here, and shore

   -3 outputs, take_fox, take_goose, and take_corn

   output indicates which object farmer could transport for each case

   shore indicates which shore the farmer is on
   
   

6. Binary to BCD Decoder

   -4 inputs

   -5 bits of output

   output is BCD value of input binary number
   
   

7. Stable Isotope Number

   -4 inputs, giving atomic number for the first 10 elements in the periodic table

   -3 outputs, binary representation of the number of stable isotopes of the element
   
   

8. Most Common Stable Isotope

   -4 inputs, giving atomic number for the first 10 elements in the periodic table

   -? outputs, binary representation of the number of neutrons in the most common stable isotope of the element
   
   

9. Digits of Pi

   -4 inputs, giving binary number of decimal place (up to 10)

   -4 outputs, giving binary value of the corresponding digit of Pi (for input of zero, output should be binary value of '3')
   
   

10. Digits of e

    -4 inputs, giving binary number of decimal place (up to 10)

    -4 outputs, giving binary value of the corresponding digit of e (for input of zero, output should be binary value of '2')
    
    

11. Numbers in the Fibonacci sequence

    -3 inputs, giving binary value of a number

    -4 outputs, giving binary value of the corresponding number in the sequence (For instance, an input of 3 should give the 3rd number in the sequence, which is 2.)
    
    

12. Number of factors

    -4 inputs, giving binary value of a number

    -3 outputs, giving binary value of the number of factors, including one and itself, that the input number has. (For instance, an input of 6 should give 4, since the factors of 6 are 1, 2, 3, and 6.)
    
    

13. Order entering confederation

    -4 inputs, to give binary representation of province or territory.

    -4 outputs, indicating what order the province or territory became part of Canada. (The original 4 provinces would all have order 1.)
    
    

14. Number of prime ministers from each province

    -4 inputs, to give binary representation of province or territory.

    -?? outputs, indicating how many prime ministers were born in that province or territory.
    
    

15. Provincial/territorial ocean access

    -4 inputs, to give binary representation of province or territory.

    -3 outputs, indicating which ocean(s) (if any) the province or territory has access to, directly or by river.
    
    

16. Hexadecimal to Roman Numeral

    -4 inputs, giving binary value of a number up to 15

    -? outputs, identifying which symbols are needed to indicate the value in Roman numerals. (The outputs will be X, V, and a few I's, but the order is important, since you need to distinguish 4 from 6, and 9 from 11.)
    
    

17. Month details

    -4 inputs, to give binary representation of month.

    - output indicating whether or not the month has 31 days
    - output indicating whether or not the month contains an equinox
    - output indicating whether or not the month contains a solstice
    - outputs for 4 seasons, indicating whether any of the month is in the given season