These are the problem sets used in this paper
Some of these questions come from textbooks. Where appropriate, we refer to the textbook problem instead of reproducing the text in these files. When conducting the study, we used the full text of the problems without reference to origin. I aimed to remove ones directly from textbooks from the posted dataset, preferring to reference by origin. If I missed one, please let me know and I will be happy to fix the affected sets.
Other problems have origins that may be unknown to me. Many have been problems I have used for associated classes for a long while, some dating back to my time as a TA in graduate school. Some are similar to a problem I saw elsewhere and were rewritten by me for various reasons, and to varying degrees, over time; some were done so as to hide their origin (such as for take-home assessments).
The following books have at least one problem appearing in the problem set and are referenced as such in the problem sets.

• Jeff Erickson, Algorithms; problem and chapter numbers reflect an access date of November 14, 2024
The book is available online from the author.
• [GT-DS] Michael T. Goodrich, Roberto Tamassia, David M. Mount. Data Structures and Algorithms in C++, 2nd Edition.
• [KT] Jon Kleinberg and Eva Tardos. Algorithm Design, 1st Edition.
• [Levitin] Anany Levitin. Introduction to the Design and Analysis of Algorithms

The problem sets are separated mostly into individual files for data structures and algorithms problems, while Theory of Computation is a single file.

• Binary Trees
• Greedy Algorithms
• Dynamic Programming
• Network Flow
• Graph Algorithms
• Graph Reductions
• Divide and Conquer
• Stacks and Queues
• Theory of Computation