Open University - M269 Algorithms, data structures and computability Module 

EXCELLENT CONDITION; GRAB A GREAT BARGAIN!

M269: Algorithms, data structures and computability, a 30-credit OU level 2 module, running over 31 study weeks. The current official page says it is organised into three parts, covering basic data structures, algorithmic techniques, trees/graphs, backtracking, dynamic programming, computability, and P vs NP.

The current official page describes three parts:

  1. Basic data structures, collections, algorithm complexity and runtime.
  2. Trees, graphs, search, recursion, divide-and-conquer and greedy algorithms.
  3. Graph techniques, backtracking, dynamic programming, computability and P vs NP.

Package Contains:


M269 - Algorithms, Data Structures and Computability (*** 2023 - Module Set ***)

M269 Core Module materials  

- M269 Core Module Notes LIKE NEW

- M269 Logic and the Limits of Computing LIKE NEW

- Problem Solving with Algorithms and data structures using python LIKE NEW 

- Specimen Exam Paper LIKE NEW

- Specimen Exam Solution LIKE NEW


- Exam Paper 2014  LIKE NEW 

- Exam Paper 2015  LIKE NEW 

- Exam Paper 2016  LIKE NEW

- Exam Paper 2017  LIKE NEW
- Exam Paper 2018  LIKE NEW

- Exam Paper 2019  LIKE NEW