Computational Method, Method or algorithm that can be carried out by a computer to solve a problem, Computable Problem, Problem for which an algorithm exists that can produce a solution in a finite amount of time, Non-computable Problem, Problem for which no algorithm exists that can always produce a solution, Tractable Problem, Problem that can be solved computationally in a reasonable amount of time, Intractable Problem, Problem for which a solution may exist but cannot generally be found in a reasonable amount of time as problem size grows, Halting Problem, Problem of determining for every possible program and input whether that program will eventually stop; no algorithm can solve this for all cases, Heuristic, Rule or approximation used to find a good solution efficiently without guaranteeing the optimal solution, Backtracking, Problem-solving method that builds a solution incrementally and abandons a path when it cannot lead to a valid solution, Brute Force, Solving a problem by systematically trying all possible candidate solutions until one is found, Divide and Conquer, Breaking a problem into smaller sub-problems, solving them and combining their results, Recursion, Technique where a subroutine calls itself to solve smaller instances of a problem, Base Case, Condition that stops further recursive calls

A Level: Computational Methods and Problem Classification - Mr Gopal

av
Skriv ut
Bädda in

Rankningslista

Visuell stil

Alternativ

AI-förbättrat: Denna aktivitet innehåller innehåll genererat av AI. Lära sig mer.

Växla mall

Återställ sparas automatiskt: ?