explain the differences between abstraction and reality and the need for abstraction

devise an abstract model for a variety of situations

describe the need for reusable program components

identify the inputs and outputs for a given situation as well as pre-conditions

interpret simple algorithms to describe their purpose

design algorithms to solve complex problems

hand trace a complex algorithm to say what it does

determine the parts of a problem that can be executed concurrently

outline the benefits and trade-offs that might result from concurrent processing in a particular situation

give an example of how caching is used in a computer system, as well as nature, benefits and drawbacks

Identify the components of a problem and order of steps to solve a problem

identify the points in a solution where a decision has to be taken and determine the logical conditions that affect the outcome of a decision

determine the logical conditions that affect the outcome of a decision

identify sub-procedures needed to solve a problem

give an example of a Divide and Conquer algorithm and explain how it works using an example.

give examples explain and apply  backtracking, data mining, heuristics, performance modelling, pipelining and visualisation