diff --git a/manifests/week13.md b/manifests/week13.md
new file mode 100644
index 0000000000000000000000000000000000000000..71deeeae630fee213df96fd81edaee52454d4f0c
--- /dev/null
+++ b/manifests/week13.md
@@ -0,0 +1,2 @@
+practicals/week13/recap-practical-1.md
+practicals/week13/recap-practical-2.md
\ No newline at end of file
diff --git a/manifests/week14.md b/manifests/week14.md
new file mode 100644
index 0000000000000000000000000000000000000000..36480139ead7322ebb57e237de931e4f2e7208f1
--- /dev/null
+++ b/manifests/week14.md
@@ -0,0 +1,3 @@
+practicals/week14/tasks.md
+practicals/week14/notes.md
+practicals/week14/code.py
\ No newline at end of file
diff --git a/practicals/week13/recap-practical-1.md b/practicals/week13/recap-practical-1.md
new file mode 100644
index 0000000000000000000000000000000000000000..c2dc31103e311ebe0fe656fde53d6ea6c0050e61
--- /dev/null
+++ b/practicals/week13/recap-practical-1.md
@@ -0,0 +1,28 @@
+Hi everyone, 
+
+As informed by the module feedback we did last week, this week is a recap/ catchup week. 
+
+Two key things were indicated as needing clarification; python programming and the assessment.
+
+Lecture 1 this week will allow us to recap python. 
+In the practicals you should then work through the previous weeks programming and work on anything you missed and/or did not understand. 
+
+You are expected to work with your practical tutor on this and address something that you did not previously understand. If you are finding python/coding challenging and are new, **focus on week 8**
+
+As a reminder 
+
+Week 8 Covers:
+- Printing
+- Variables
+- Conditionals
+- Loops 
+- Functions
+
+Week 9 Covers:
+- Conditionals
+- Boolean algebra
+
+Week 12 Covers:
+- More complex data structures
+- Classes
+- Tuples, sets and lists
\ No newline at end of file
diff --git a/practicals/week13/recap-practical-2.md b/practicals/week13/recap-practical-2.md
new file mode 100644
index 0000000000000000000000000000000000000000..ad8a2abb9074e7a78e097c98593c4a81564fa84c
--- /dev/null
+++ b/practicals/week13/recap-practical-2.md
@@ -0,0 +1,25 @@
+Hi everyone, 
+
+As informed by the module feedback we did last week, this week is a recap/ catchup week. 
+
+Two key things were indicated as needing clarification; python programming and the assessment.
+
+Lecture 2 this week will include an overview and dive into (with examples) of the 
+assessment work. This lecture is exceptionally important, **attendance will be reviewed for this session in particular** and you should note that attending will allow you to vote on how we approach the next week of work.
+
+You should attempt to prepare prepare some of your assessment work to be reviewed in the practical session by your tutor. This practical is a chance to catch up with the work across the previous weeks. So far you should have worked on the following:
+
+- A decomposition tree (diagram - which is included into your report as [described here](https://uwe.cloud.panopto.eu/Panopto/Pages/Viewer.aspx?id=a60f118a-4071-401e-bf9c-b0a600a85760&instance=Blackboard))
+- A discussion of your decomposition (150 words)
+- A discussion of the feasibility of solving your problem (150 words)
+- A description of some functional and non functional requirements of your problem (150 words)
+- A flow diagram (diagram - which is included into your report as [described here](https://uwe.cloud.panopto.eu/Panopto/Pages/Viewer.aspx?id=a60f118a-4071-401e-bf9c-b0a600a85760&instance=Blackboard))
+- Describe your process of creating a flow diagram for your chosen problem.
+- Implement some code that simulates the problem for which you made a flow diagram
+- For your problem create an entity relationship diagram (diagram - which is included into your report as [described here](https://uwe.cloud.panopto.eu/Panopto/Pages/Viewer.aspx?id=a60f118a-4071-401e-bf9c-b0a600a85760&instance=Blackboard))
+- Program a representation of this diagram
+- Write up your process of modelling the data for your problem (150 words)
+- Further refine your data structures using tuples, sets, lists, dictionaries and classes
+- Further discuss your data model (150 words)
+- Begin to implement and discuss the algorithm for your problem (300 words)
+