Reminder that you must complete the pre-reading before each class.
On this page:
✔️ Pre-reading for Tuesday 7/27
✔️ Pre-reading for Wednesday 7/28
✔️ Pre-reading for Thursday 7/29
Pre-Reading for Intro to Graphs
Essential Questions
Before attending class, please complete the material below and use the following questions to guide your note-taking:
✔️ 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 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)
Pre-Reading for BFS & DFS
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
- Watch Depth First Search vs Breadth First Search (Graph) (6 min)
- Watch Advanced Data Structures: BFS and DFS Time Complexity (6 min)
Pre-Reading for Dijkstra (and closing)
Essential Questions
Before attending class, please complete the material below and use the following questions to guide your note-taking:
✔️ What is Dijkstra’s algorithm and purpose does it serve?
✔️ How does Dijkstra’s algorithm work?
✔️ How can I use what I’ve learned in this class to prepare for technical interviews?
✔️ What kinds of questions should I expect during an interview?
Read/Watch/Review
- Read Dijkstra’s Algorithm
- For a step-by-step explanation and visualization, read Dijkstra’s Shortest Path Algorithm - A Detailed and Visual Introduction
- Read Getting a Gig: A Guide
- Read How Data Structures and Algorithms are important for Computer Science Graduates?
- Review Practice Interview Questions and Sites