Describe The Problem-Solving Cycle

Research A Problem's Background

Identify Relevant Information

Break A Problem Into Parts

Determine Simplifying Assumptions

Use Abstraction For Systems

Abstract Knowledge For A Model

Translate A Problem Into A Model

Compute A Solution

Build A Computer-Interpretable Model

Use Technology To Solve Problems

Solve The Modelled Problem

Analyse And Operate On The Model

Interpret The Solution In Context

Refine And Iterate A Model

Report On The Solution Process

Represent Situations As Networks

Use Network Terminology

Distinguish Graph Types

Use Adjacency Matrices

Multiply Matrices

Interpret Adjacency-Matrix Products

Translate Between Representations

Understand Spanning Trees

Find Minimum Spanning Trees

Use Dynamic Programming Terms

Apply Bellman's Principle

Apply Dijkstra's Algorithm

Compare Shortest-Route Techniques

Use Algorithms To Solve Problems

Distinguish Greedy And Dynamic-Programming Algorithms

Justify An Algorithm's Optimality

Apply Networks To Project Scheduling

Apply Critical-Path Concepts

Describe 1D Particle Motion

Interpret Velocity And Acceleration As Derivatives

Convert Between Motion Quantities (1D)

Solve 1D Kinematics Problems

Derive The Kinematics Formulae

Represent Displacement As A Vector

Apply Vector Algebra

Represent Vectors By Components

Use The Dot Product

Convert Between Motion Quantities (2D)

Apply Newton's Laws In Vector Form

Solve Projectile Motion Problems

Define Force

Draw Free-Body Diagrams

Find The Resultant Force On A Plane

Resolve Forces On Surfaces