Data Structures and Algorithms

What you'll learn

The key areas this subject covers, mapped to the official curriculum.

• Abstract data types
• Arrays, stacks, queues and linked lists
• Binary trees and traversals
• Graphs, shortest paths and spanning trees
• Sorting and searching algorithms

Course units

The structured path through this subject.

1. 1

   Introduction to Data Structures & Algorithms

   Abstract data types, complexity analysis and the mathematical tools used to compare algorithms.

   4 topics · 4 lessons available

2. 2

   Stack

   The last-in-first-out structure: operations, implementations and applications.

   4 topics · 4 lessons available

3. 3

   Queue

   The first-in-first-out structure: operations, implementations and variants such as circular and priority queues.

   4 topics · 4 lessons available

4. 4

   Recursion

   Functions that call themselves: base cases, recursion trees, and iterative equivalents.

   5 topics · 5 lessons available

5. 5

   Lists

   Sequential structures built from nodes: singly, doubly and circular linked lists and their uses.

   5 topics · 5 lessons available

6. 6

   Sorting

   Rearranging collections into order: simple and divide-and-conquer sorts, their complexity and stability.

   5 topics · 5 lessons available

7. 7

   Searching and Hashing

   Finding data quickly: linear and binary search, hash functions and collision resolution.

   4 topics · 4 lessons available

8. 8

   Trees and Graphs

   Hierarchical and networked structures: binary trees, AVL trees, graph representations and graph algorithms.

   6 topics · 6 lessons available