Hash and access

This is a quiz to reinforce OCR AS level theory 5.1.4 on hashing, database definitions and a bit of 5.1.3
What S is when files/data are accessed in order from the start of the file?. What A is like a recipe, a procedure for accomplishing a task? There is likely to be maths involved?. What C is what happens when a hash algorithm tries to store something in a used block?. What H is the process of calculating a numeric value from one or more data items?. What T is the data structure where hashed values are stored?. What R is the basic unit of data stored in a data file?. What P is the unique value used to identify a record?. What E is the overall name for the contents of a table?. What C is a key that is formed by combining two or more fields?. What M is a type of hashing algorithm?. What S is when files are accessed in order, but are sorted?. What I is something that can be added to sequential file access to speed it up?. What F is a field in a table, but also a key field in another table?. What F is a type of database that contains only one table?. What R is when two tables have fields that are linked?. What V is used to ensure that data is correct within a database?. What T is a data type that allows any character?. What W is a form of supplementary documentation used to inform the user of their rights?. What T is an interactive help file that shows you how to perform a task?. What R is also known as direct access?.
If you are seeing this message then you do not have Adobe Flash Player installed. To see thin interactive game you will need to download the latest version of Adobe Flash Player.
Click here for more free teaching resources