URI CSC 212
Reminder that you must complete the pre-reading before each class.
On this page:
✔️ Pre-reading for Tuesday 2/16
✔️ Pre-reading for Thursday 2/18
Pre-Reading for Linked Lists (Intro & Analysis), Tuesday 2/16
Essential Questions
Before attending class, please complete the material below and use the following questions to guide your note-taking:
✔️ What are linked lists and how do they work?
✔️ What are the different types of linked lists and how do they differ from each other?
✔️ How do singly linked lists differ from dynamic arrays?
✔️ What’s the time complexity of the following operations on a singly linked list: a) insert (back vs front), b) delete (back vs front), c) search?
Read/Watch/Review
Before attending class, please complete the material below:
- Read What’s a Linked List, Anyway?, Part 1
- Optional TLDR-version: Read Introduction to Linked Lists
- Watch Intro to Linked Lists (4 min)
- Read Arrays, Linked Lists, and Big O Notation
- Watch Big O Notation for Linked Lists (4 min)
In Class
In today’s class we’ll be reviewing the algorithms for a single linked list’s operation.
Pre-Reading for Linked Lists (Implementation), Thursday 2/18
Essential Questions
✔️ What’re the steps necessary to insert an element (at beginning, end, and anywhere else) on a singly linked list?
✔️ What’re the steps necessary to delete an element (at beginning, end, and anywhere else) on a singly linked list?
Read/Watch/Review
Before attending class, please complete the material below:
- Read the Lab 4 Handout
- Watch Linked List Animation (3 min)
- Assumes no tail pointer
- Explore the visualization sites below:
In Class
In today’s class we’ll be continuing to work on our lab’s SLL implementation.