Oral Exams in a Virtual Classroom - Inside Higher Ed
In summer 2021, I taught a 6-week undergraduate online course on algorithms. One novel (to both me and the students) aspect of my course was that most students took an oral final exam (rather than a written one). In this article, I reflect on how that experience went, and I give advice to instructors who are considering oral exams.
My interview with Jothy Rosenberg - Duke Graduate School
In 2020, I had the opportunity to interview Jothy Rosenberg, serial entrepreneur and founder of The Who Says I Can't Foundation. We discussed his career, family, his best memory at Duke, and other things.
The blog posts below are ranked according to how I feel about them, which is a crazy thing to do because obviously they're all literary masterpieces. I welcome you to read them all and disagree with my ranking.
Actually, you are an imposter
You feel like you're not as good as everyone else, but you've heard of imposter syndrome. Maybe you actually are an imposter? Or maybe there's more to it.
Craving a non-student identity
I'm almost 27, and I've been a student for as long as I can remember. But I'm also not super excited for what comes next: having a real job. Am I having a quarter-life crisis?
Four metrics for friendship
Why do different friendships feel different?
Why learn algorithms?
This post is for the computer science major feeling forced to take an algorithms class, and wondering, "What if I just want to be a software engineer?
Grammatical Errors in the New York Times
I combed through 17 quizzes written by the NYT, and in this post, I summarize the solutions. I also share some of my favorite uncategorized errors; a spoiler-free version is here.
My first video
I once made a video about a card trick, and here's a post reflecting on my experience.
Realizations from my first internship
I once interned at IQVIA, where I learned a few things about corporate life.
What is "algorithms"?
Let's explore the distinct, but related, meanings of one word that's gotten tossed around a lot.
My mini textbook on algorithms
Basic Graph Algorithms, Greedy Algorithms, Dynamic Programming, Paths in Graphs, Maximum Flows, Linear Programming, NP-Hard Problems, Approximation Algorithms
What the Best College Teachers Do by Ken Bain
It's somewhat inspiring, but I wish it were more concrete.