Topic 5

Click on the Topic code (e.g. 5.1.1) to download the class slideshow on that topic:

5.1 – Abstract Data Structures (HL only)

Point Description PDF More
Thinking recursively
5.1.1 Identify a situation that requires the use of recursive thinking 5.1.1 Video
5.1.2 Identify recursive thinking in a specified problem solution 5.1.2 Video
5.1.3 Trace a recursive algorithm to express a solution to a problem 5.1.3
Abstract data structures
5.1.4 Describe the characteristics of a two-dimensional array 5.1.4
5.1.5 Construct algorithms using two-dimensional arrays 5.1.5
5.1.6 Describe the characteristics and applications of a stack 5.1.6 Video
5.1.7 Construct algorithms using the access methods of a stack 5.1.7
5.1.8 Describe the characteristics and applications of a queue 5.1.8 Video
5.1.9 Construct algorithms using the access methods of a queue 5.1.9
5.1.10 Explain the use of arrays as static stacks and queues 5.1.10 Video
Linked lists
5.1.11 Describe the features and characteristics of a dynamic data structure 5.1.11 Video
5.1.12 Describe how linked lists operate logically 5.1.12 Video
5.1.13 Sketch linked lists (single, double and circular) 5.1.13 Video
5.1.14 Describe how trees operate logically (both binary and non-binary) 5.1.14 Video
5.1.15 Define the terms: parent, left-child, right-child, subtree, root and leaf 5.1.15
5.1.16 State the result of inorder, postorder and preorder tree traversal 5.1.16  Video
5.1.17 Sketch binary trees 5.1.17  Video
5.1.18 Define the term dynamic data structure 5.1.18 Video
5.1.19 Compare the use of static and dynamic data structures 5.1.19  Video
5.1.20 Suggest a suitable structure for a given situation 5.1.20  Video