Main memory and data structures

Question 1 of 10

Explain how a hash table works and give two real-life applications.

Question 2 of 10

RAM is described as volatile because it

Question 3 of 10

A data structure that stores key–value pairs and finds a value quickly from its key is a

Question 4 of 10

Distinguish between sequential (linear) and non-linear data structures, giving two examples of each.

Question 5 of 10

Searching for a word in a 100,000-entry dictionary stored in a hash table typically takes

Question 6 of 10

Explain the role of main memory when a program that uses data structures is running.

Question 7 of 10

A two-dimensional array is like a

Question 8 of 10

Compare an array and a linked list for storing a list of names that often changes size.

Question 9 of 10

State four features of main memory (RAM).

Question 10 of 10

A computer has 8 GB of RAM. How many megabytes is this (using 1 GB = 1024 MB)?