# CAScade assessment in the new Computing PoS KS1-3

**CAScade: Online CPD from CAS Computing at School.**

*Today’s hangout: *

The draft PoS Computing: Computing

**What is an algorithm**: A formula or set of steps for solving a particular problem. To be an algorithm, a set of rules must be unambiguous and have a clear halting point. (www.webopedia.com) *this is one answer, there are many others*. More definitions listed below in the chat room comments section.

Key points discussed:

What will each primary school delivered and how that will impact Secondary.

Dept of Education wanting to step away from levels.

Schools will be responsible for creating their own curriculum. Share resources, crowd source curriculums.

Agiles testing: testing quadrants. Using this for assessment tool. Agile Testing Quandrants

ALL subject levels are going- not just for ICT aka Computing.

**E- portfolios: as assessment.
Competitions.
End of year TechJams/ hackdays against certain criteria**.

A good scratch activity that covers: logic, variables, objects, algorithm: Scratch Quiz

Open badges: Open Badges

**Chat room comments from CAScade hangout on Assessment**.

Miles Berry

11:33 AM

http://properosolutions.com/wp-content/uploads/2011/03/agile-testing-quadrants.jpg

.

Miles Berry

11:40 AM

Here’s what we put in the guidance notes

Ben Smith

11:40 AM

how to distinguish a ks2 algorithm from a ks4 algorithm

having a clear conceptual hierarchy would help ext/diff, assessment etc.

Miles Berry

11:40 AM

An algorithm is a precise method of solving a problem. Algorithms range from the simple (such as instructions for changing a wheel on a car) to the ingenious (such as route-finding), and cover many different application areas (for example, cookery, drawing three- dimensional graphics; solving systems of constraints, such as a school timetable; understanding images; numerical simulation, and so on).

An algorithm can be expressed as a program in many different programming languages.

There may be more than one algorithm to solve a single problem, differing in their simplicity, efficiency, or generality. For example, to find a path through a maze, one (simple, slow) algorithm might be to simply walk around at random until you find the exit. Another (more complicated) one would involve remembering where had been to avoid going down the same blind alley twice. Another might be to keep you left hand on the wall and walk till you find the exit (faster, but does not work on all mazes, and so less general).

me

11:41 AM

A formula or set of steps for solving a particular problem. To be an algorithm, a set of rules must be unambiguous and have a clear ‘stopping point’.

.

Miles Berry

11:42 AM

Hmm… clear stopping point… Hmm halting problemâ€¦

Ben Smith

11:47 AM

you can do boolean algebra on mine craft