- Implementation of data structures, including stacks, queues and trees
- Searching, merging and sorting
Candidates should be able to:
a. explain how static data structures may be used to implement dynamic data structures;
b. describe algorithms for the insertion, retrieval and deletion of data items stored in stack, queue and tree structures;
c . explain the difference between binary searching and serial searching, highlighting the advantages and disadvantages of each;
d . explain how to merge data files;
e. explain the differences between the insertion and quick sort methods, highlighting the characteristics, advantages and disadvantages of each.