Introduction

Welcome Who am I? Coding Assessment

Course Introduction Challenges

Introduction Positional Notation Converting Between Bases Binary Addition Binary Multiplication Challenges (Python) Challenges (Java)

Introduction The Modulus Operator Cyphers Modular Arithmetic Modular Inverse Challenges (Java)

Introduction Algorithms Time Functions Asymptotic Complexity Summation Challenges

Introduction Propositional Logic Conjunction and Disjunction Implication and Equivalence Bitwise Operators Challenges

Introduction Sets Subsets and Supersets Set Operations Challenges

Introduction Graphs Directed Graphs Structure of Language Search Trees Neural networks Game Object Trees Challenges Graph Question Generator

Introduction Proof Proof by Cases Proof by Contradiction Proof by Induction Challenges

Maths to Code Challenges Question Generator

Introduction Statistics Measures of Central Tendency Measures of Spread Data Visualisation Correlation Challenges

Introduction Probability Basics Combinatorics Probability Trees Law of Total Probability Bayes Rule Challenges

Introduction Probability Distributions Samples and Populations Hypothesis Testing Z Scores Student's T-Test Challenges

Logic is used for formal reasoning, ensuring that, if our premises are true, our conclusions are true

Digital circuits perform propositional logic using logic gates, which are fundamental to how computers work.

Understanding how to use bit-wise operations is useful in writing efficient programs.