Upcoming Deadlines and Exams
- Mon Oct 2
- Guided Problem Set 5 due at 9pm on PrairieLearn
- Tue Oct 3
- Homework 5 due at 9pm on Gradescope
- Fri Oct 13
- ⚠️ Drop deadline (11:59pm)
- Mon Nov 5
- Midterm 2: 7–9pm, location TBA
- Tue Nov 6
- Conflict Midterm 1: time and location TBA
Recent Announcements
- Fri Sep 29
- Homework 5 has been updated with an important clarification to problem 1.
- Wed Sep 27
-
Solutions and tentative rubrics
for Midterm 1 are available.
- Tue Sep 26
-
- Guided Problem Set 5 is available on PrairieLearn.
- Homework 5 is available.
- Mon Sep 25
-
Midterm 1 will be held in the following rooms; please go to the room assigned to the first letter of your last (family) name.
- A–J: 141 Wohlers Hall (≤145 students, 306 seats, one block west of the Eye of Sauron)
- K–O: 100 Gregory Hall (≤93 students, 218 seats, just west of Foellinger)
- P–T: 151 Loomis Laboratory (≤89 students, 215 seats)
- U–Z: 103 Mumford Hall (≤83 students, 202 seats, just east of the Eye of Sauron)
- Sat Sep 23
-
Solutions and a walkthrough video for the second practice midterm are available.
- Thu Sep 21
-
Two practice exams are available on the exams page.
- Practice exam 1 is the one I mostly solved in today's review session. Unfortunately, my wireless mic's battery died halfway through the review session, so the video is mostly silent. I will post a new walkthrough video and complete solutions later today.
- I will post a walkthrough video and solutions for Practice exam 2 on Saturday.
- Mon Sep 18
-
Midterm 1 will be offered next Monday, September 25, from 7pm to 9pm. (We're still working on the location.)
- The exam will cover all material from Homeworks 1 through 4 and the corresponding Guided Problem Sets—string induction, regular expressions, DFAs, product constructions, fooling sets, NFAs, closure properties of regular languages, language transformations, and (very lightly) context-free languages, but not Turing machines.
- Please read and understand the exam policies.
- Study problems:
- A large collection of exam-style study problems is available. Please take the first page seriously. You can also find exams from past semesters either on past semesters' course web sites, or in Jeff's exam archive.
- Another large collection of auto-graded study problems is available on PrairieLearn. Some of these are variants of past guided problem sets; others are simple multiple-choice questions; still others are Pythonic free-response problems. All the advice from page 1 of the fodder applies to these problems as well.
- Review/study sessions:
- Instead of a lecture this Thursday, there will be an optional review session at the usual lecture time and location. Jeff will walk through a sample midterm on Thursday; we will post the sample midterm here by Wendesday. The review session will be recorded as usual.
- Instead of labs this Friday, there will be optional review sesions at the usual lab times and locations.
- We will hold "study parties" this Thursday evening, this Saturday afternoon, and next Monday morning at the usual "homework party" times and locations.
- HKN will hold a review session on Sunday, September 24, from 3pm to 5:30pm, in ECE 1002 (the main ECE lecture hall).
- The conflict exam will be held on Tuesday, September 26, 11am–1pm.
- If you cannot attend the regular exam for any of the reasons outlined in the student code, please fill out the registration form no later than Friday, September 22.
- If you need to take the conflict exam but you have additional conflicts both immediately before and immediately after the 374 lecture on September 26, please fill out the registration form no later than Wednesday, September 20.
- If you have a DRES accommodation, you are welcome to take the exam at the DRES Testing Accommodation Center on Monday or Tuesday. We strongly recommend scheduling your exam at TAC immediately. If you are not taking the exam at TAC and you have an accommodation for extra time, please take the conflict exam.
- Fri Sep 15
-
Homework 3 solutions are available. (Sorry for the delay.)
- ∞
- Earlier announcements
Si maintenant vous me donnez une équation que vous aurez choisie à votre gré, et que vous desirez connaître si elle est ou non soluble par radicaux, je n’aurai rien à y faire que de vous indiquer le moyen de répondre à votre question, sans vouloir charger ni moi ni personne de la faire. En un mot les calculs sont impracticables.
Algorithms are for people who don't know how to buy RAM.
The only way to learn is by playing, the only way to win is by learning,
and the only way to begin is by beginning. So without further ado, let's begin.
— Sam Reich, Game Changer (2019–present)