OCR H446 · Component 02

2.3.1 Algorithms

Analyse complexity, trace searches and sorts, manipulate data structures and compare shortest-path algorithms.

Topic overview

Build accurate recall, then apply it.

RecallStride combines active flashcards, quick checks, exam practice and scheduled review. Progress is based on learning evidence rather than passive completion.

A binary tree has root M; M's left child is F and right child T; F has children C and H; T has left child R only. Give post-order and breadth-first traversals.Trace
A bounded stack uses indices 0-3; top is the index of its top item and -1 means empty. Give pseudocode to push value v without overflowing.Write
Perform one left-to-right pass of ascending bubble sort on [17,5,12,3], comparing adjacent pairs in order.Trace
In a singly linked list, previous points to a node before target; target is not the first node. Give the link update to remove target and explain whether values shift.Write
What should be established before designing an algorithm for a scenario?Design
Why trace an algorithm with empty, one-item and boundary-value inputs?Testing

Published with owner authorisation; awaiting independent academic review. RecallStride is independently produced and is not endorsed by OCR. OCR is a registered trademark of OCR.