This test is run by .
Note that your final mark will not be saved in the system.
Note that your final mark will not be saved in the system.
3 - Data Structures Typeit
Target Level
C
Running Total
0
0%
Attempt
1 of 3
Type the correct answers into the spaces. Fill all the spaces before clicking ‘Check Answers!’
Type the most appropriate data structure for each scenario below.
Note: As most data structures can be modelled using an array, to remove ambiguity, none of the correct answers below are 'array'.
| Which data structure would be most appropriate to model a street layout in which many streets interconnect with each other, and it's possible to drive around in a loop? | |
| Which data structure would be best suited to the syntax analysis of the compilation process, in which IF, FOR and WHILE structures must be closed in the opposite order to that in which they opened? | |
| Which data structure is utilised by a keyboard buffer? The keys that are pressed as an application starts up are not displayed immediately on the screen, but should ultimately appear in the order in which they were typed when start-up is complete. | |
| What is the most appropriate data structure to represent a directory structure for saving files? | |
| Which data structure would be most appropriate for modelling 'friendship' connections on social media, wherein any member can be friends with many other members? | |
| Which data structure should handle print jobs on a network, if the intent is that they are always printed in the order in which they are generated? | |
| Which data structure's properties best lend themselves to storing the 'undo' actions within a word processing application? When 'undo' is clicked, the most recently completed action should be undone. |