CS 201 - Fall 2021.
[Home]
Welcome to CS 201!
Video of the Day
Morning Pro Musica Birds and Music Introduction
Logical problem of the day
In the very fine movie My Cousin Vinny,
the judge who has a diploma from "Yale University" (played by the actor Fred Gwynne, who
went to Harvard), tries to prove the defense lawyer, Vinny Gambino (played by
Joe Pesci), to be a fraud. I have realized that actually,
it is the judge who is a fraud. Explain.
https://pollev.com/cs201
You may also download the app to your phone. Use the "cs201" poll id.
Lecture 21: Gates and Circuits. 10/25/2021
Administrivia
I have office hours Wednesdays from 4-6 pm, on zoom, id 459 434 2854.
[Assignments].
hw6 is available
Midterm grades have been posted. See Rob's note in Ed Discussion.
You can request regrades all this week.
Average: 49.25
Median: 51
Max: 60
Quartiles: 45 51 54.5
Mid-Semester Feedback.
- Good stuff: Rob, ULAs, YouTube/Video Walk throughs, problem sets,
anecdotes.
- Larger font.
- Prefer longer, twice weekly classes.
- Would like collaboration within CS.
- Initial pace quite demanding for several weeks.
- Louder microphone.
- Lectures should cover theory and then Racket code.
- Summary of topics
- Course web site is (a) well organized and (b) confusing.
De gustibus non disputandum est.
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 October 31st. (Halloween)
- If you are planning to submit a video, send me a note
with the members of your team.
Lecture: Gates and Circuits.
Regarding last week's rendition of
Tom Lehrer's "New Math": TomLehrer.org and
Tom Lehrer
Gates.html (jupyter) Gates and
Circuits. - sequential circuits
NAND latch video SR = "Set / Reset". SPOILER ALERT: The analysis of the states
is reminiscent of the proof of the Halting Problem. Prepare
to be confused.
Flip Flop video More user friendly. Kind of chatty actually.
Core memory:
Getting to know UNIX
UNIX
Introduction - Principle 3.
[Home]