Lesson about Hash Tables. Contains elements of component 1.4.2 (b,c) from OCR A-Level Computer Science spec. Lesson has exam style questions with mark scheme.
Contains explanations of Hash tables and their uses. The lessons covers why they are used (where they can be used) and examples of how collisions can be resolved in hash tables with the use of linear probing and chaining. Has a full example of how hash tables are indexed and how collisions can be resolved.
Included is a Powerpoint with notes and tasks, exam question worksheet to help aid progress.
Please leave a review with your feedback. Thanks
Get this resource as part of a bundle and save up to 33%
A bundle is a package of resources grouped together to teach a particular topic, or a series of lessons, in one place.
Something went wrong, please try again later.
This resource hasn't been reviewed yet
To ensure quality for our reviews, only customers who have purchased this resource can review it
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.
£2.50