---
# System prepended metadata

title: Lecture 8 Setup/Prep
tags: [Setup]

---

---
tags: Setup
---

# Lecture 8 Setup/Prep

In this class, we will convert our functional implementation of lists into an implementation of mutable lists, following the conceptual presentation from the last lecture.

During class, we will
- Add a `LinkList` class to our previous list implementation (we'll call our class `LinkList` so we don't clash with the built-in `LinkedList` class name)
- Make `LinkList` implement mutable lists
- Add a new method `addLast` that adds an element to the end of the list
- Start to optimize some of our methods for time performance

## Prep

- Make sure you have the [starter code](https://brown-cs18-master.github.io/content/lectures/07listsimperative/lec07.zip) that was posted for lecture 7 (which we didn't get to using last time -- we'll start from there).
- Review the [memory map slides from last class](https://brown-cs18-master.github.io/content/lectures/07listsimperative/memory-layout-lists.pptx), so that you are familiar with the memory layout we want to achieve with our `LinkList` class.
- See if you can finish the following statement: "A LinkedList/wrapper class is needed to create mutable lists because ..."
- (Optional) If you want to try the problem in advance, try to add a `LinkList` class to the starter code to serve as our list wrapper.