CS 201 - Spring 2025. 3/5/2025.

Welcome to CS 201!

Video of the Day

I hereby solicit suggestions for the video of the day. Please email me your ideas with explanations. Selected entries will win 5 homework points. If your video is played at the beginning of class, you must also briefly explain something about the video and something about yourself - in person.

Logical Problem of the day

Another license plate problem: the car's prestige license plate reads: TAN 270. What kind of car is it? Bonus question: what is the best thing about spring?

https://pollev.com/slade You may also download the app to your phone. Use the "slade" poll id.

Canvas Quiz of the Day (need daily password)

Most days, there will be a simple canvas quiz related to the lecture. You need a password to activate the quiz, which I will provide in class. These quizzes will count toward your class participation grade. The quiz is available only during class.

Click for today's quiz.

Lecture 22: Boolean Functions + UNIX.

I have office hours Wednesdays from 4-6 pm, on zoom, id 459 434 2854. No office hours during break.

I am available for lunch on Mondays at 1 pm in Morse. No lunch during break.

ULA office hours are found at https://csofficehours.org/CS201/schedule. Sign up via the queue.

Homework assignments: [Assignments]. hw5 is now available.

Announcements

If you have an upcoming performance or athletic event, I am happy to promote it during class. Just send me a note.

Information Society Project Yale Law School. Weekly Events

CS 201 Video Contest

In the tradition of the racket/beat it song we have a song for Turing Machines: Would It Be Computable? to the tune of "Wouldn't It be Loverly?" from My Fair Lady.

You are invited to create a music video for this song. Here are the rules:

The winning submission will receive 10 homework points for each member of the team.
Runners-up will receive 5 homework points for each member of the team.
Each team may have up to 4 CS 201 students. Non-CS 201 students may also contribute, but they would not receive any points.
CS 201 students may be on at most one team.
If there are multiple submissions, we will have a vote in class to select the winner.
Submissions are due by midnight April 1st.
If you are planning to submit a video, send me a note with the members of your team.

Second song contest: The Internet Fugue.

In class on February 3rd, I introduced Toch's Geographical Fugue (wiki + score) as well as my derived Internet Fugue Here is a sample recording of the first 32 bars by a guest artist using GarageBand. It took 10 minutes and it shows.

You are invited to perform the Internet Fugue either on video, or (preferably) live in class. The rules and rewards are the same as above.

Lecture: Boolean Functions.

Boolean.html (jupyter) XOR and friends

Review hw4. Use case special form for all-vars and eval-in-env. - satisfiable? Boolean satisfiability problem, aka, SAT, is the first NP-complete problem. All other NP-complete problems can be reduced to SAT in polynomial time.

Python zip() can be useful for truth-table problem. Of course, you have to write it in racket. See zip-env in staff solution.

Propositional Calculus, where an environment is a model, that is, a row of a truth table.

Unification, like match in hw4.

Getting to know UNIX

UNIX Introduction Principle 3.

[Home]