AQA

1

C/Science Progress Grade

Your current progress out of 10

Includes assessments and L/Objectives

0.00

Assessment Average Score

Based upon assessments out of 0

0%

Assessment Best Score

** - 0 results **

0%

Assessment Weakest Score

** - 0 results **

0%

ID | Skill_name | RAG |
---|---|---|

3.1 | Fundamentals of algorithms | |

3.1.1 | Representing algorithms | |

R0 | I can understand how to make notes using the Cornell notes template | |

R1 | I can understand and explain the term algorithm. | |

R2 | I can understand and explain the term decomposition. | |

R3 | I can understand and explain the term abstraction. | |

R4 | I can explain simple algorithms in terms of their inputs, processing and outputs. | |

R4 | I can represent simple algorithms using flowcharts or pseudo-code | |

R5 | I can represent algorithms using flowcharts, pseudo-code and use them to create program code | |

R6 | I can use trace tables and visual inspection to determine how simple algorithms work. | |

3.1.2 | Efficiency of algorithms | |

R7 | I can understand that more than one algorithm can be used to solve the same problem. | |

R9 | I can compare the efficiency of algorithms and explain how some algorithms are more efficient than others in solving the same problem. | |

3.1.3 | Searching algorithms | |

R7 | I can understand and explain how the linear search algorithm works. | |

R7 | I can understand and explain how the binary search algorithm works. | |

R7 | I can compare and contrast linear and binary search algorithms. | |

3.1.4 | Sorting algorithms | |

R9 | I can understand and explain how the merge sort algorithm works. | |

R8 | I can understand and explain how the bubble sort algorithm works. | |

R9 | I can compare and contrast merge sort and bubble sort algorithms. |

Click on name for Lesson link

0 results forUnknown Login

Copyright © 2013 -2018 LearnITwithMrC

## Recent Comments

## Teacher Date: 28-09-21

## Unknown Login

## Enter Your comment