|
| 1. | Explain and apply the basic concepts of number systems and the use of Binary, Decimal and Hexadecimal number systems, and demonstrate competence in the conversion of numbers from one representation to another. |
| 2. | Define the basic logic gates, such as AND, OR NOT in terms of Truth Tables and utilise Truth Tables to prove the functionality of simple gate networks. Explain the universality of NAND and NOR gates. |
| 3. | Demonstrate familiarity with Boolean Operations, the Laws of Boolean Algebra, de Morgans Theorems and the application of Boolean Algebra and Karnaugh Maps to simplify logic circuits. |
| 4. | Describe and employ Combinatorial Logic to create Ripple Adders and Look Ahead Adders, Comparators, Decoders, Encoders, Multiplexors and De-multiplexors. |
| 5. | Implement flip-flops and related storage devices, use sequential logic to create counters, registers and multistate control systems and explain how to use finite state machines and transition matrices. |
| 6. | Explain and describe the basic components of a computer. |
| 7. | Use effective communication methods to convey ideas and principles. |
|
| | Assessment Task | Value (of total mark) | Related Learning Outcome/s |
|---|
| 1. | Circuit Design and Simulation Tutorials (equivalent to 12 pages) | 36% | - 1 - Explain and apply the basic concepts of number systems and the use of Binary, Decimal and Hexadecimal number systems, and demonstrate competence in the conversion of numbers from one representation to another.
- 2 - Define the basic logic gates, such as AND, OR NOT in terms of Truth Tables and utilise Truth Tables to prove the functionality of simple gate networks. Explain the universality of NAND and NOR gates.
- 3 - Demonstrate familiarity with Boolean Operations, the Laws of Boolean Algebra, de Morgans Theorems and the application of Boolean Algebra and Karnaugh Maps to simplify logic circuits.
- 4 - Describe and employ Combinatorial Logic to create Ripple Adders and Look Ahead Adders, Comparators, Decoders, Encoders, Multiplexors and De-multiplexors.
- 5 - Implement flip-flops and related storage devices, use sequential logic to create counters, registers and multistate control systems and explain how to use finite state machines and transition matrices.
- 6 - Explain and describe the basic components of a computer.
- 7 - Use effective communication methods to convey ideas and principles.'
|
| 2. | Mid-semester test (2 hours) | 24% | - 1 - Explain and apply the basic concepts of number systems and the use of Binary, Decimal and Hexadecimal number systems, and demonstrate competence in the conversion of numbers from one representation to another.
- 2 - Define the basic logic gates, such as AND, OR NOT in terms of Truth Tables and utilise Truth Tables to prove the functionality of simple gate networks. Explain the universality of NAND and NOR gates.
- 3 - Demonstrate familiarity with Boolean Operations, the Laws of Boolean Algebra, de Morgans Theorems and the application of Boolean Algebra and Karnaugh Maps to simplify logic circuits.
- 4 - Describe and employ Combinatorial Logic to create Ripple Adders and Look Ahead Adders, Comparators, Decoders, Encoders, Multiplexors and De-multiplexors.
- 5 - Implement flip-flops and related storage devices, use sequential logic to create counters, registers and multistate control systems and explain how to use finite state machines and transition matrices.
- 6 - Explain and describe the basic components of a computer.
- 7 - Use effective communication methods to convey ideas and principles.'
|
| 3. | Final Test (2 hours) | 40% | - 1 - Explain and apply the basic concepts of number systems and the use of Binary, Decimal and Hexadecimal number systems, and demonstrate competence in the conversion of numbers from one representation to another.
- 2 - Define the basic logic gates, such as AND, OR NOT in terms of Truth Tables and utilise Truth Tables to prove the functionality of simple gate networks. Explain the universality of NAND and NOR gates.
- 3 - Demonstrate familiarity with Boolean Operations, the Laws of Boolean Algebra, de Morgans Theorems and the application of Boolean Algebra and Karnaugh Maps to simplify logic circuits.
- 4 - Describe and employ Combinatorial Logic to create Ripple Adders and Look Ahead Adders, Comparators, Decoders, Encoders, Multiplexors and De-multiplexors.
- 5 - Implement flip-flops and related storage devices, use sequential logic to create counters, registers and multistate control systems and explain how to use finite state machines and transition matrices.
- 6 - Explain and describe the basic components of a computer.
- 7 - Use effective communication methods to convey ideas and principles.'
|
|
