Prior content: None
Previous Section: Decision 1
Next Section: Graphs and Networks
Contents
- Whole Topic Notes
- 1A Using and Understanding Algorithms
- 1B Flow Charts
- 1C Bubble Sort
- 1D Quick Sort
- 1E Bin-Packing Algorithms
- 1F Order of an Algorithm
- Whole Topic Summary Resources (Including Past Paper Questions)
Whole Topic Notes
Full Notes to Accompany Examples
Dr Frost
- Dr Frost Decision 1 Algorithms Section
- Dr Frost Decision 1 Algorithms Slides
FMSP Whole Chapter Videos
- FMSP Decision 1 (AS) playlist (Courtesy of MEI)
1A Using and Understanding Algorithms
Textbook resources
FMSP Video Courtesy of MEI
Dr Frost resources
No Live Lesson Video Yet
Download Slides
Key Skills
Note all numbers are subject to change and will be updated once all key skills have been finished by Dr Frost
1B Flow Charts
Textbook resources
FMSP Video Courtesy of MEI
Dr Frost resources
No Live Lesson Video Yet
Download Slides
Key Skills
Note all numbers are subject to change and will be updated once all key skills have been finished by Dr Frost
1C Bubble Sort
Textbook resources
FMSP Video Courtesy of MEI
Dr Frost resources
No Live Lesson Video Yet
Download Slides
Key Skills
Note all numbers are subject to change and will be updated once all key skills have been finished by Dr Frost
- 904a: Carry out a single pass of the bubblesort algorithm.
- 904b: Carry out multiple passes of the bubblesort algorithm.
- 904e: Determine the range of an unknown value in a list after one pass of bubblesort has been carried out.
- 904f: Carry out multiple passes of a shuttle sort algorithm.
- 904: Exam Practice: Sorting algorithms
1D Quick Sort
Textbook resources
FMSP Video Courtesy of MEI
Dr Frost resources
No Live Lesson Video Yet
Download Slides
Key Skills
Note all numbers are subject to change and will be updated once all key skills have been finished by Dr Frost
1E Bin-Packing Algorithms
Textbook resources
FMSP Video Courtesy of MEI
Dr Frost resources
No Live Lesson Video Yet
Download Slides
Key Skills
Note all numbers are subject to change and will be updated once all key skills have been finished by Dr Frost
- 906a: Calculate the lower bound of bins needed when use a bin-packing algorithm.
- 906b: Use the first-fit algorithm to put items in bins of a given size.
- 906c: Use the first-fit decreasing algorithm to put items in bins of a given size.
- 906d: Use the full-bin algorithm to put items in bins of a given size.
- 906e: Reason about the range of the bin size given the bins after use of the first-fit algorithm.
- 906f: Determine the possible values of an unknown value in a bin after use of the first-fit algorithm.
- 906: Exam Practice: Bin-packing algorithms
1F Order of an Algorithm
Textbook resources
FMSP Video Courtesy of MEI
Dr Frost resources
No Live Lesson Video Yet
Download Slides
Key Skills
Note all numbers are subject to change and will be updated once all key skills have been finished by Dr Frost
- 909a: Estimate the time required for an algorithm with linear order given the size of the input, using proportional reasoning.
- 909b: Estimate the time required for an algorithm with quadratic order given the size of the input, using proportional reasoning.
- 909c: Estimate the time required for an algorithm with order log n or n log n, using proportional reasoning.
- 909d: Understand O notation, and write the time complexity given an expression for the number of steps.
- 909e: Identify the order of different sorting and search algorithms.
- 909f: Identify the maximum run-time T(n) of common algorithms.
- 909g: Order algorithms in terms of the order of their runtime complexity.
- 909: Exam Practice: Order of algorithms