Schedule

Student presentations (extra credit)

Use this form to give feedback after each presentation.

Dijkstra 2: A* Boolgaloo - Ivy O'Neal-Odom, Delaney Fowler
- Review Dijkstra's algorithm, discuss the use of heuristics, and expand on Dijkstra's algorithm with A*.
Clustering (Greedy Algorithm) - Anne-Gail Moreland and Simon Dutton

Incredible Divide and Conquer Algorithm - Haya Diwan, Minhail Khan & Tiffany Tang
- A more concrete knowledge on divide and conquer algorithms and recurrence relations. This will help us revise previous problems and make sure we understand.
A New Algorithm: Convex Hull (Divide-and-conquer) - Kexin Wang & Yaling Qing
- Lead students think about the problem and try their own approaches. After that, show the algorithm with a goal of students understanding the algorithm.

Images as a network!! - Amelia Tran, Lydia Cheah
- Our lesson will walk students through one of the applications of the network flow problem—image segmentation—that is a central problem in image processing. We will introduce the idea of reducing a problem to a maximum flow/minimum cut problem and by doing so, we can achieve an optimal solution using algorithms we've seen before.

Art Gallery Problem - Xinyi Lyu, Xiaoxiao (Grace) Xu
- Art Gallery Theorems and Algorithms - Joseph O'Rourke

Demystifying Dynamic Programming - Holly Hong & Niannian Liu
- In the presentation, we will provide several most popular dynamic programming questions among coding interviews. Our goal is not only to walk through the solving processes, but also to generalize the similarities and lead fellow classmates to dive into the core strategies of DP.

Phylogenetic Trees - Emily Fleming
- They will learn a bit about evolution and how relationships between species are defined. We will also learn about the sequence alignment algorithm, and how it runs in an intuitive way.
Cracking the Interview Question - Coco Choo, Yifang Ke, Yunqi Huang
- Apply algorithms we learned in class to interview questions (divide&conquer; DP, etc)
- Practice solving the algorithms in groups and explaining thought process to each other
- Learn and understand the efficient approach of the question we give
Interview Practice Involving Greedy Algorithms - Fatema Uddin, Sabrina Hussaini, YoungKyung Kwon
- Students will get practice thinking through and solving with classmates an interview question related to greedy algorithms.

Report abuse