FREE Stacks, Queues & Hash Tables Sample | AQA A Level Computer Science 7517 | 2 Worksheets + Answer

Two free sample worksheets on stacks, circular queues and hash tables for AQA
A Level Computer Science (7517), with full answer keys, so you can see
exactly what the full pack contains before buying anything.

Each sheet traces a stack through push, pop and peek operations, traces a
circular queue showing every slot of the array so the wrap is visible, and
adds keys to a hash table, rehashing on collision.

The conventions every one of those tables depends on are printed at the top
of the sheet: where the top pointer points and what it is when the stack is
empty, where rear points, how a full queue is tested, and whether a removed
slot is erased. Textbooks disagree on all four, so none of them is left to
chance - and the answer keys say which alternative answer not to accept.

These two sheets are not in the paid pack - they are extra, so nothing is
wasted if you buy it afterwards.

The full pack contains 20 worksheets and 20 answer keys, on twenty different
sets of operations. Search Tes for “AQA A Level Computer Science stacks
queues hash tables” to find it.

If these are useful, a review is genuinely appreciated - it is the only way
other teachers find resources like this.