Data Structures: Theory

Specification Points
Specification Reference Specification Point
3.3.5.a

explain how static data structures may be used to implement dynamic data structures

 
3.3.5.b

describe algorithms for the insertion, deletion and amendment of data items stored in
list, stack, queue and tree structures
3.3.5.c

explain the difference between binary searching and serial searching, highlighting the advantages and disadvantages of each

explain how to merge data files

explain the difference between the insertion and quick sort methods, highlighting the characteristics, advantages and disadvantages of each

 

Resources

Mini Website - Data Structures

This mini website covers the specification points 3.3.5.a and b

Students should read through the information and make their own notes.

There are some suggestions for tasks in the 'Lesson Ideas' section which could be used to accompany the website.
data structures
Mini Website - Data Searching, Merging and Sorting

This mini website covers the search methods

Students should read through the information and make their own notes.

 
data structures

 

 

 

 

 

 

 

 

 

 

Copyright © www.teach-ict.com