Python implementation of hash table pseudo-code from Cambridge International AS and A level Computer Science Coursebook - CAMBRIDGE UNIVERSITY PRESS section 23.8
• write algorithms to find an item in each of the following: linked list, binary tree, hash table
• write algorithms to insert an item into each of the following: stack, queue, linked list, binary tree, hash table
3.1.2 File organisation and access
• show understanding of methods of file access – direct access for sequential and random files
We are committed to providing the highest quality teaching resources for GCSE and A Level Computer Science to inspire students while giving teachers everything they need to deliver first-class lessons.
It's good to leave some feedback.
Something went wrong, please try again later.
Nice solution thank you
JUST CODE! does not explain what they are, powerpoint for topic would have been useful.
Report this resourceto let us know if it violates our terms and conditions.
Our customer service team will review your report and will be in touch.