🪴 Quartz 4.0

Search

SearchSearch
          • De Morgan's Law
          • Searching Algorithms
          • Sorting Algorithms
          • CULMINATING
          • Indentation style
          • Jegification
          • pain
          • Times i goofed up
          • Conditionals or Selections
          • For loops
          • Methods
          • Switch-case
          • Tricks
          • While Loop
          • 2D Arrays
          • Array Lists
          • Arrays
          • Data Types
          • Maps and Hashmaps
          • Stacks
          • Strings
          • Abstract classes
          • Accessibility modifiers
          • Classes
          • Constructor Overloading
          • Final
          • Inheritance
          • Interfaces
          • Object (The class)
          • OOP
          • OOP Concepts
          • Shadowing
          • Interpreter
          • Java Compiler
          • JVM
          • Low-level and High-level languages
        • Errors
        • Exam Review
        • Flow charts for conditionals
        • GUI's
        • Handling Errors
        • Input
        • Randomization
        • Reading and Writing Files
        • Recursion
        • Swapping numbers
          • Closures
          • Imperative Vs Declarative
          • Prompt Engineering
          • Concepts to learn
          • Leetcode questions I've yet to do
          • Bucket Sorting
          • C++ libraries and methods
          • C++ Syntax
          • Prefix and Suffix
            • a
            • 04-22
            • Electron Forge
            • Getting Started
            • Integrating React and Typescript
            • npm link
            • random things i find and want to figure out
            • Shared Local Package or Library
            • Getting Started
            • Untitled
            • Layout
            • Properties
            • Relative and Absolute positions
            • Array Concatenation
            • Promises
            • Zustand
            • Preamble and Advice
            • Components
            • Function Components (FC)
            • JSX Fragment
            • Props
            • Re-Rendering
            • Stale Closure
            • States
            • Updating on resize
            • Using Style Sheets
            • Interfaces
            • Union and Intersection Type Operators
            • Variables and types
          • Initializing Typescript in a npm project
          • JS Conventions
          • Things I've noticed
          • Android Testing
          • B07 Exam review
          • Everything I keep forgetting
          • Hash Codes
          • Lecture 1 (05-05)
          • Lecture 1 Concise
          • Lecture 2 (05-12)
          • Lecture 3 (05-26)
          • Lecture 4 (06-02)
          • Lecture 4 (06-02).sync-conflict-20250704-085637-O477LPQ
          • Lecture 5 (06-09)
          • Lecture 6 (06-16)
          • Lecture 7 (06-23)
          • Lecture 9 i think
          • Lecture 12 (08-05)
          • Review Set 1
          • Syllabus
            • All commands in order
            • All commands in order.sync-conflict-20250611-153036-FW436ZV
            • ls command
            • tee
            • $@ vs $star
            • CL readings
            • Cl Readings for SSH
            • Dot files
            • Filter Commands
            • I O Streams
            • Kernel and Processes
            • Lecture 1 (05-08)
            • Readings
            • Redirection and Pipelining
            • Viewing small files in Unix
            • Working with directories in unix
            • Arguments and Parameters
            • Arithmetic
            • Arrays and Associative Arrays
            • Bash Features
            • Cl chapta 7
            • Cl Readings for Scripting (24-36.1)
            • CL Readings Part 2
            • Command Substitution
            • Conditionals (AND, OR, NOT, etc.)
            • Dot Command
            • Every command ever
            • Exit Codes
            • Functions
            • getopts
            • Grouping (and Sequential Composition)
            • Here Document
            • Lecture (05-15)
            • Loops
            • Patterns to match filenames (and Case)
            • Precedence
            • Quotes and Escapes
            • Simple Command
            • String vs File argument
            • Test Commands
            • Variables
            • Lecture 3 (05-22)
            • Environment Variables
            • Lecture 4 (05-29)
            • Enums
            • Function Pointers
            • Global Variables
            • Implicit Number Promotion
            • Integer Types and Literals
            • Lecture 5 (06-05)
            • Memory Stuff
            • Number Type Conversion
            • typedef
            • Union Types
            • C Input Output
            • Lecture 06-26 (Modularisation!)
            • Notes (07-08)
            • Notes (07-08).sync-conflict-20250716-154051-MBE4QS2
            • Processes and Redirection
            • Signals
            • Networks and Sockets
            • Multiplexing
          • Exam Review Part 1!
          • Exam Review Part 2!
          • Previous Exam Questions
          • temp
          • Tutorial 1 (week 2)
            • Admin things
            • Boolean Logic
            • Boolean Logic to Hardware
            • Circuits with Physical Switches
            • CMOS (or Transistor) Circuits
            • Computers
            • Creating Gates as (CMOS) Circuits
            • Determining transistor circuit output
            • Floating output
            • Hardware Design Advice
            • Inversion Bubble
            • Lecture 1 (05-06)
            • Logic Circuits... or Circuit Logic
            • Logic Gates
            • Notation (Operators) used in computer engineering
            • Open Circuit
            • Physical Representation of Boolean Values
            • Principles of CMOS design
            • Processors
            • Series and Parallel Circuits
            • Short-Circuiting
            • Syllabus
            • Transistors (pMOS and nMOS)
            • Vcc and Ground
            • Waveforms
            • XOR
            • Boolean Algebra
            • Converting to NAND gates
            • Creating complex circuits
            • Gate Cost G(Y) and GN(Y)
            • Lecture 2 (05-13)
            • Minimal Circuits (K-maps)
            • Minterms and Maxterms
            • Binary Subtraction
            • Combinational Circuits and Logic
            • Comparitors
            • Data Bits
            • Decoders
            • Demultiplexers
            • Deterministic Values
            • Dont Care values
            • Full Adders
            • Half-Adders
            • Lecture 3 (05-20)
            • Multiplexers
            • NAND gates as inverters
            • Overflow
            • Ripple-Carry Binary Adder
            • Signed Bin Numbers (2's complement + sign-and-magnitude)
            • Subtraction Circuit
            • Clock Cycle
            • Clocked (Gated) SR Latch
            • Combinational and Sequential Circuits
            • D Latch
            • Edge-Triggered
            • Flip Flops
            • Intuition Behind Storing Values
            • Lab 2
            • Latches
            • Lecture 4 (05-27)
            • Propagation Delay
            • T and JK Flip-flops
            • Unstable State
            • Counters
            • Counters with Load
            • Finite State Machines (Moore)
            • Lecture 5 (06-03)
            • Memory Hierarchy
            • Moore and Mealy Machines
            • Race Conditions
            • Shift and Load Registers (n-bit)
            • State Machines
              • Adder (Shifter) and Accumulator
              • Array Multiplier
              • Binary Multiplication
              • Booth's Algorithm
            • ALU
            • ALU Flags
            • Datapath
            • Lecture 6 (06-10)
            • Lecture 6 (06-10).sync-conflict-20250625-095850-O477LPQ
            • Control Unit
            • Data Bus
            • Instruction Register
            • Instructions
            • Lecture 06-24
            • Load-Store Architecture
            • Main Memory
            • Microprocessor
            • Register File
            • Running Programs
            • Lecture Recording (Notes on 06-26)
            • Lecture 07-08
            • Review
            • Lecture 07-15
            • Recursion Video
            • Hardware stuff!
            • Lecture 07-22
            • Multicycle CPU!
            • Signals
            • The 'other' components of the ALU
            • Exam Review Lecture
          • B58 Final Exam Review Time!
          • Lab 3
          • Lab 3 part 2
          • Project Stuff
        • TT2 Review
            • Collatz Conjecture
            • Floats & Floating Point Imprecision
            • Good Practice and BAD Practice
            • Include
            • Introduction
            • Running Code
            • things we did in week 1
            • Conditionals
            • For Loops
            • things we coded in week 2
            • 01-22 (memory stuff)
            • 01-27
            • 01-29
            • 02-03
            • Chapter 3 reading notes to sort
            • 02-12 (tutorial on testing)
            • 02-26 (Complexity)
            • Notes (02-24)
            • 03-03
            • 03-05
            • BST stuff more yay
            • (03-10) Ethics lecture 1
            • 03-12 (Graphs)
            • Recursion
            • 03-17
            • 03-19
            • 03-24
            • 03-26
            • 03-31
            • 04-02
          • Abstract Data Types (ADT)
          • Arrays
          • Booleans
          • Casting & Type Conversion
          • Compilers and Compiling
          • Compound (Composite) Data Types
          • Constants and Define
          • Containers
          • Dynamic Memory Allocation
          • Every evil question i think paco could ever ask
          • Exercises
          • Exit codes
          • Functions
          • Helpful C Resources
          • Linked Lists
          • Lists
          • Matricies
          • Memory Models
          • Past code samples to refer to
          • Pointers and Manipulating Memory
          • printf
          • Program Structure
          • Questions
          • Queue ADT
          • Random Questions I have
          • Scope
          • Segfault
          • Shadowing
          • Strings
          • Table of Common Complexities
          • Things to study for the mid-term
          • Unary Operators
          • Understanding Memory
          • User Input
          • Variables
      • Untitled
      • XOR and XNOR Gate Shortcut
    Home

    ❯

    Summer 2025 Courses

    ❯

    CSCB58

    ❯

    Week 1

    ❯

    Boolean Logic to Hardware

    Boolean Logic to Hardware

    Sep 01, 20251 min read

    You can represent Boolean Logic in these ways so far:

    • Expressions (duh) and all the other math-y ways (truth tables)
    • Waveforms
    • Logic Circuits… or Circuit Logic
    • (Transistor) Circuits

    Graph View

    Backlinks

    • Lecture 1 (05-06)

    Created with Quartz v4.2.3 © 2025

    • GitHub
    • Discord Community