Slides: Linked Lists, Continued

class: title
# Linked Lists, Continued
## CSC 161 – April 16, 2026

---
# Agenda for Today
1. Quiz
1. Department Events
1. Upcoming Work
1. Discussion
1. Lab
1. Wrap Up

---
class: section green
# Quiz

---
# Department Events
## Ali Akgun '93 Talk Today
.indent[
   How AI Works, and How It's Changing the Way We Work  
   Thursday, April 16th at 11am in the HSSC Auditorium (2nd floor)
]

## CS Table: Fault-Tolerant Computing
.indent[
   Tuesday, April 21st at noon in JRC 224C
]

---
class: section blue
# Upcoming Work

---
# Homework: Pathfinding
**Due:** Thursday, April 23rd

## Questions?
*None so far.*

---
class: section blue
# Discussion

---
# Discussion: Linked List Variations
**Items for think, pair, share:**

1. Why do you think it might be useful to keep a pointer to the last node in a linked list in addition to the usual `head` or `first` pointer?

2. How are doubly-linked lists different from regular linked lists?

3. What are the advantages and disadvantages of using doubly-linked lists?

---
class: section green
# Lab Time

---
class: section blue
# Wrap Up

---
# Peer Educator Evaluations

.left-col[
Fill out the form at <https://tinyurl.com/26S-mentor-evals> to evaluate mentors and other peer educators you've worked with this semester.

## Token Opportunity
If at least 20 students in the class complete the mentor evaluation by 11:59pm on Sunday, April 19th I will give you all one additional token.
]
.right-col[
<img src="../files/26S-mentor-evals-qr.png" width=80%>
]

---
# Wrap Up

## Lab Report
Submit your completed `string_stack.c`, `string_stack.h`, `string_queue.c`, and `string_queue.h` files from this week's lab.

These are the same files you submitted for the array-based stack and queue last week, so double check to make sure you're uploading the right ones.

## Pathfinding Assignment
Start early so you have time to think and debug!

## Reading

- **Introduction to SDL 2.0** (SDL2 Wiki)
              
            
              
- **Beginning SDL2**