Category Archives: Assignments

CORRECTIONS:

• Clarification in 4.2.1. Note that we’re allowing a “set” to be a collection of possibly non-unique items–more like a list. Solve the (harder) problem for sets of unique items for a bonus point!
• Typo in 4.2.1. Not “a set of positive integers S of size 2n”, but “a set of positive integers S of size 12n“.
• Error in 1.1.2 (and the quiz problem it comes from): C(i, j) equals A[i][j] plus the minimum of the options, not just the minimum of the options. (Else the answer would always be 0!)
• Typo on 2 (various parts) the BestDeShredScore code should have a trampoline call to its helper like “return Helper([false, false, …, false], 0)”, where there are n false entries in the initial array
• Clarification on 4 (various parts) we said “set” and meant it, but we’re allowing “multi-set”; see @521 for more details
• on 4, individual quiz, problem 1: S[2n-i] should be S[2n-i-1]. (Or S[i] should be S[i+1], depending on 0-based vs. 1-based indexing.)

Here is Assignment #5, composed of the collected tutorial quizzes, solutions to those quizzes, and some extra questions building on the quizzes for the assignment. (Here is LaTeX source, with a .txt extension so the blog lets us post it!)

The assignment is due on Fri 1 Dec at 10PM. Please submit it on GradeScope.

Here is Assignment #4, composed of the collected tutorial quizzes, solutions to those quizzes, and some extra questions building on the quizzes for the assignment. (Here is LaTeX source, with a .txt extension so the blog lets us post it!)

The assignment is due on Fri 17 Nov at 10PM. HOWEVER, we expect to base some of the midterm problems on these quizzes/assignment. So, we strongly recommend that you create a solid draft solution before the exam (which may not yet be in clean enough form to submit).

Please submit it on GradeScope.

Here is Assignment #3, composed of the collected tutorial quizzes, solutions to those quizzes, and some extra questions building on the quizzes for the assignment. (Here is LaTeX source, with a .txt extension so the blog lets us post it!)

Quick reminder on one question: a wBST is a BST. So, it has the search tree property. That should be important if you want to do operations that depend on the order of keys in the structure.

The assignment is due on Fri 27 Oct at 10PM. (Which is actually almost as spooky as the last due date on Fri the 13th, what with Halloween coming up.)

Please submit it on GradeScope.

Here is the initial version of Assignment #2, composed of the collected tutorial quizzes, solutions to those quizzes, and some extra questions building on the quizzes for the assignment. (Here is LaTeX source, with a .txt extension so the blog lets us post it!)

NOTE that we may add to the assignment shortly after the exam (by the end of the day Monday after the exam at the latest).

The assignment is spookily due on Fri 13 Oct at 10PM.

Please submit it on GradeScope.