Business and technology qualifications, Levels 3-6, in Brussels. Explore qualifications
Portal login
Level 4 Diploma in Cyber Security

Logic gates and circuits: transistors as switches, half-adders and adders

CYB403 · Principles of Computer Systems — Week 7 of 16

CourseCYB403
Week7 of 16
SemesterI
TutorOnline in the course chat

This week’s topics

Logic gates and circuits: transistors as switches, half-adders and adders

  1. Transistors as switches and MOSFETs
  2. Implementing logic operations in circuits
  3. Half-adders and adders built from logic gates in Verilog

What you will be able to do

  • 4.3 Explain how logical operations are implemented using transistors in electronic circuits.
  • 4.4 Explain how complex arithmetic operations can be built up from basic logic.
  • 4.5 Implement basic arithmetic operations using logic gates.

Activity

Start with this week’s 4 videos, then: Seminar, guided reading and a short written task: explain how logical operations are implemented using transistors in electronic circuits.

Study materials

Videos

  • Creating logic circuits · Oak National Academy, Key Stage 4 (GCSE level) · for registered students
  • Constructing Truth Tables for Combinational Logic Circuits · YouTube · Engineers Academy · 10 min · for registered students
  • Understanding Logic Gates · YouTube · Spanning Tree · 7 min · for registered students
  • Everything about Logic Gates in 12 Minutes | AND, OR, NOT, NOR, NAND, XOR, XNOR Gates · YouTube · Brain Station Advanced · 12 min · for registered students

Further resources

  • The Elements of Computing Systems, ch. 2: Boolean Arithmetic · PDF · Nisan & Schocken, The Elements of Computing Systems 2e, ch. 2 (2nd ed.): half adders and full adders as simple logic circuits; 12 pp. · for registered students
  • A symbolic analysis of relay and switching circuits · Open-access article · Shannon (1938), Transactions of the AIEE (MIT thesis version). The classic showing that switching circuits follow Boolean algebra. · for registered students
Materials marked “for registered students” open in the student portal, which is set up as soon as you receive final acceptance.
Course chat

Admitted students ask questions on this week’s page in the student portal: an AI assistant trained on the course answers first, and during the course’s timetabled classes Connect to your tutor brings your tutor into the chat, who may start a call if needed.

Open this week in the portal
Course plan
  • Week 1: Computer components: CPU, memory, buses, input/output devic…
  • Week 2: How components work together: the fetch-execute cycle, buse…
  • Week 3: Memory: the Von Neumann model, registers, cache, RAM and RO…
  • Week 4: Principles of state machines: finite state machines, Mealy …
  • Week 5: Implementing state machines in Python and Verilog
  • Week 6: Information representation: binary, decimal and hexadecimal…
  • Week 7: Logic gates and circuits: transistors as switches, half-add…
  • Midterm: Midterm evaluation
  • Week 9: Machine code, assembly and high-level languages: abstractio…
  • Week 10: Assembly instruction sets compared: ARM, MIPS, x86, x86-64,…
  • Week 11: Programming in ARM assembly: essential instructions, contro…
  • Week 12: Applying Principles of Computer Systems in practice: case s…
  • Week 13: Assignment workshop: research, planning and referencing
  • Week 14: Assignment workshop: drafting, feedback and improvement
  • Week 15: Review and coursework completion
  • Final: Final assessment and submission
Back to the course
Scroll