1. Lists Theory of Information

2. Lists  Imagine that you want to send a parcel to a friend that is secure and confidential…  How would you do it?

3. Lesson Objectives 1. Know the difference between a linear list and a linked list 2. Explain how lists are used in computing 3. Know 3 types of Queues and the differences between them

4. Alice and Bob  Books, keys and post office boxes…

5. Static & Dynamic Lists  Linear Lists vs. Linked Lists  Read through the notes from the link below and answer the first set of exercises on Linked Lists vs. Linear Lists  Lists Wikibooks Link Lists Wikibooks Link Lists Wikibooks Link

6. Questions? Give a definition of a liner list Give a definition of a liner list Give a definition of a linked list Give a definition of a linked list What is a static data structure? What is a static data structure? Give two benefits of a linked list over a linear list Give two benefits of a linked list over a linear list

7. Binary Tress  Using the information from the Binary Trees PDF, complete the integer sequencing tasks on the board  Trees Trees

8. Binary Trees  Using the Ordered Binary Tree method, give the ordered sequence of integers for;  35, 47, 12, 40, 30, 57, 6

9. Extension  Read the notes of Graphs and complete the exercises in your books Graphs… Graphs… EXTENSION TASK

10.  Be able to label and use Ordered Binary Trees  recursive algorithms recursive algorithms recursive algorithms