Welcome to CMSC120-F2026! First time here? — Read the Syllabus.

Coming up

Everything scheduled this term.

Due Sep 1, 2026

Build a flag in Pyret, replace every repeated number with a name so the whole thing scales from one value, then turn it into a function you can call at three different sizes.

Due Sep 8, 2026

Programs that branch. Small, because Week 2 is a single class.

Due Sep 15, 2026

One question, asked of a whole list. First with the built-in list functions, then by writing one yourself, then about people rather than stripes.

Due Sep 29, 2026

The stripe and the flag drawn in text, with Check.is where where: was. First, a three-question setup survey: a GitHub username, where you run Java, and which Java that is.

Due Oct 6, 2026

Builders that change in place, four predictions checked before they run, and a die you can test because its seed is fixed.

Due Oct 13, 2026

Six small functions that decide: if with return in every branch, ? : in one line, and &&, ||, !, with the examples at the edges.

Due Oct 20, 2026

The cinema’s rules: a chain of ifs in the right order, checked at its edges; enums and switch, with an answer for every value; and records, a value made of named parts.

Due Oct 27, 2026

A1’s flags with Img: stripes that scale from one number, a record and an enum that say which flag, and the reading’s own colors.

Due Nov 3, 2026

A taxi’s day as a list of rides: filter and map for which rides and where to, fold for the takings and the route, each a line with an arrow in it; then seven by hand, with a switch on the list, four of them carrying a value down the calls.

Due Nov 10, 2026

A taxi’s day again, walked with while loops: sums and counts with a name that changes, a loop that stops early, lists that come out backwards; then loops with no list behind them.

Due Nov 17, 2026

Counting loops, a loop inside a loop, and map, filter and fold written by hand; then Pascal’s triangle, and the picture hiding in it.

No matching items
In class Aug 31, 2026
At the start of class.
In class Sep 14, 2026
Both attempts in class — one at the start, one near the end.
In class Sep 21, 2026
First half of class. Open book, open notes, no AI. Pyret, not Java.
In class Sep 28, 2026
Both attempts in class — one at the start, one near the end.
In class Oct 5, 2026
Both attempts in class — one at the start, one near the end.
In class Oct 19, 2026
Both attempts in class — one at the start, one near the end.
In class Oct 26, 2026
First half of class. Open book; no AI, no collaboration, and no device but the lab computer. Java, from the first file through enums and records.
Due Nov 2, 2026
In class Nov 2, 2026
Both attempts in class — one at the start, one near the end.
In class Nov 9, 2026
Both attempts in class — one at the start, one near the end.
In class Nov 16, 2026
First half of class. Open book; no AI, no collaboration, and no device but the lab computer. Lists in Java, while and for.

Every assignment is on the Assignments page, and every week’s reading on the Schedule.