URI CSC 212
Reminder that you must complete the pre-reading before each class.
On this page:
✔️ Pre-reading for Tuesday 6/15
✔️ Pre-reading for Wednesday 6/16
✔️ Pre-reading for Thursday 6/17
Pre-Reading for Pointers
Essential Questions
Before attending class, please complete the material below and use the following questions to guide your note-taking:
✔️ What is a pointer and what purpose does it serve?
✔️ How do pointer variables work?
✔️ What is the relationship between arrays and pointers?
✔️ What do arithmetic operations do to pointers?
✔️ How should pointers be initialized?
✔️ How should pointers be compared?
✔️ What does it mean to pass a pointer as a function parameter?
✔️ What does it mean for a function to return a pointer?
✔️ What needs to be true in order for a function to return a pointer?
✔️ How do pointers work with class objects?
Read/Watch/Review
If you haven’t already, please download this PDF textbook to complete the “Gaddis” readings below and to use for future reference.
- Watch Introduction to Pointers in C++ (12 min)
- Read Gaddis 10.1-10.7
- Watch Introduction to C++ pointers Programming Tutorial (11 min)
- Watch How to use pointers and arrays (13 min)
- Read Gaddis 10.10-10.11
- Explore Pointers Tutorial
- Run and edit the code examples provided so you can gain a better understanding of the concepts being explained.
Pre-Reading for Linked Lists (Intro & Analysis)
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)
Pre-Reading for Linked Lists
Essential Questions
Before attending class, please complete the material below and use the following questions to guide your note-taking:
✔️ 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 11 Handout
- Watch Linked List Animation (3 min)
- Assumes no tail pointer
- Explore the visualization sites below: