Reminder that you must complete the pre-reading before each class.

On this page:
✔️ Pre-reading for Tuesday 4/13
✔️ Pre-reading for Thursday 4/15

---

Pre-Reading for Heapsort & Intro to Graphs, Tuesday 4/13

Essential Questions

Before attending class, please complete the material below and use the following questions to guide your note-taking:

✔️ How does the heapsort algorithm work?
✔️ What is heapsort’s time complexity and why?
✔️ What is a graph and what purpose does it serve?
✔️ What are the various types of graphs and some of their uses/applications?
✔️ What are some ways to represent graphs in code?

Read/Watch/Review

Before attending class, please complete the material below:

• Read Heap Sort Algorithm
  • This article also reviews heaps and their array-version implementation. If you are comfortable with your understanding of heaps, scroll down about half-way to “How Heap Sort Works?”
• Watch Heap sort in 4 minutes (4 min)
• Read Don’t Understand Graphs? Here’s Why You Should Study Graphs in Computer Science
• Read Introduction to Graphs
• Watch Introduction to Graph Theory: A Computer Science Perspective (16 min)

In Class

In today’s class we’ll be reviewing heapsort and introductory graph concepts.

---

Pre-Reading for BFS & DFS, Thursday 4/15

Essential Questions

Before attending class, please complete the material below and use the following questions to guide your note-taking:

✔️ How does BFS work?
✔️ How does DFS work?
✔️ What’s the time complexity of BFS?
✔️ What’s the time complexity of DFS?

Read/Watch/Review

• Read “Tree Terms” and “BFS & DFS” from Evan’s Tree Guide
• Read Lab 12 Handout
• Watch Lab 12, Part 2 explained (11 min)
• Watch Depth First Search vs Breadth First Search (Graph) (6 min)
• Watch Advanced Data Structures: BFS and DFS Time Complexity (6 min)

In Class

In today’s class we’ll taking a recap wet toe and continuing work on Lab 12.