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)

Thinking recursively
5.1.1Identify a situation that requires the use of recursive thinking5.1.1Video
5.1.2Identify recursive thinking in a specified problem solution5.1.2Video
5.1.3Trace a recursive algorithm to express a solution to a problem5.1.3
Abstract data structures
5.1.4Describe the characteristics of a two-dimensional array5.1.4
5.1.5Construct algorithms using two-dimensional arrays5.1.5
5.1.6Describe the characteristics and applications of a stack5.1.6Video
5.1.7Construct algorithms using the access methods of a stack5.1.7
5.1.8Describe the characteristics and applications of a queue5.1.8Video
5.1.9Construct algorithms using the access methods of a queue5.1.9
5.1.10Explain the use of arrays as static stacks and queues5.1.10Video
Linked lists
5.1.11Describe the features and characteristics of a dynamic data structure5.1.11Video
5.1.12Describe how linked lists operate logically5.1.12Video
5.1.13Sketch linked lists (single, double and circular)5.1.13Video
5.1.14Describe how trees operate logically (both binary and non-binary)5.1.14Video
5.1.15Define the terms: parent, left-child, right-child, subtree, root and leaf5.1.15
5.1.16State the result of inorder, postorder and preorder tree traversal5.1.16 Video
5.1.17Sketch binary trees5.1.17 Video
5.1.18Define the term dynamic data structure5.1.18Video
5.1.19Compare the use of static and dynamic data structures5.1.19 Video
5.1.20Suggest a suitable structure for a given situation5.1.20 Video