Guided Problem Sets

Auto-graded guided problem sets on PrairieLearn are due every Monday at 9pm unless announced otherwise. The guided problem sets are intended as warmup exercises for the written homework; we strongly recommend working on them before starting the homework. You can attempt the guided problems as many times as you like, even after the due date, but only submissions before the due date count toward your final course grade.

You can also find additional practice problems for most course topics on PrairieLearn. These do not count toward your course grade, but they provide the same feedback as the guided problem sets.

Links to future guided problem sets in the list below may be placeholders the future problem sets themselves are subject to change. We will release the final version of each guided problem at least one full week before its due date.

Mon Aug 31

Guided problem set 1: Prerequisite material, string induction, and regular expressions

Tue Sep 08

Guided problem set 2: Regular expressions and DFAs

Mon Sep 14

Guided problem set 3: DFAs and NFAs

Mon Sep 21

Guided problem set 4: Fooling sets, language transformations, and CFGs

Mon Oct 05

Guided problem set 5: Divide and conquer, recursion, and recurrences

Mon Oct 12

Guided problem set 6: Dynamic programming

Mon Oct 19

Guided problem set 7: More dynamic programming

Mon Oct 26

Guided problem set 8: Graph algorithms

Mon Nov 02

Guided problem set 9: More graph algorithms

Mon Nov 16

Guided problem set 10: Polynomial time reductions and NP-hardness

Mon Dec 07

Guided problem set 11: Undecidability