CSC 311 Practice Problem Set #1
- Assuming two's complement, give the result of 00000000 -
11111111. Also indicate the result in decimal.
- Assuming two's complement, give the result of 11001011 +
11110010. Also indicate the result in decimal.
- Write a Boolean expression that represents this circuit.
- Write a truth table that represents the circuit above.
- Draw a circuit equivalent to the boolean expression ((A + B)'
- Prove xy + xy' = x using truth tables.
- Show that (A + B)' (A' + B')' = 0.
- Show how the AND function can be constructed from two NAND
- Which of the following are valid hexadecimal numbers? BED,
CAB, DEAD, DECADE, ACCEDED, BAG.
- Assuming no sign bit, give the result of 2A31BD6F + 33333333.
- Most people can only count to 10 on their fingers; however,
computer scientists can do better. If you regard each finger as one binary
bit, with finger extended as 1 and finger touching palm as 0, how high can you
count using both hands?
- Describe a simple way we could multiply
00001010 and 00000011 without doing any conversions to decimal.
Answers to these questions are available here.
Below are some more practice problems for drawing circuit diagrams and number
conversions. There will be no answers provided for these.
- F = A xor (BD)
- F = (B + C)(A + D)'(E + F)
- F = ( (AB)' + C')' (Note: on this one, try to use the minimum # of
- F = (A' + B + C) xor (ABC)'
- Convert to hex: 0011100011100101
- Convert to hex: 101.125
- Convert to decimal: 2A3.4
- Convert to binary: 16BD001CA.5F
- Convert to binary: 99.6031
- Convert the previous two answers into IEEE single precision format
- Convert into IEEE single precision: -205.771