Boolean Algebra and Digital Logic
Due date: 18-Dec-2015
Return date: 14-Jan-2016
Submission method options
Alternative submission method
Total Marks: 20
1. Using a "word" of 5 bits, list all of the possible signed binary numbers and their decimal equivalents that are representable in: [5 marks]
b. One's complement
c. Two's complement
2. Express the (-6) number in IEEE 32-bit floating-point format. [5 marks]
3. Charles Sturt University (CSU) is conducting three sessions every year. The BEGIN month for Session 1 is March, and it end is Jun. SESSION 2 BEGINS in July, and it end is October. SESSION 3 BEGINS in November, and it end is February.
Write a Boolean function and design a logic circuit, use of basic logic gates to activate these three sessions for CSU. Design a circuit with four inputs (A, B, C, and D) representing the bits in a binary number, and three outputs (S1_Active, S2_Active, and S3_Active). [7 marks]
When the input is session 1, the output S1_Active should be one and all other outputs should be zero
4. Prove using Boolean algebra that: [3 marks]
(BCâ€™ + Aâ€™D) (ABâ€™ + CDâ€™) = 0
following instruction need to be followed
Answer is correct
All steps were shown.
The circuit design is correct. The Boolean expression is minimised. All steps are explained. The circuit diagram is correct and neat.
Answer s are all correct and complete. All steps are shown and identities are listed