CS 201 - Spring 2025. 4/21/2025.

Welcome to CS 201!

Video of the Day

Logical problem of the day

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 36: Running Time of Programs.

I have office hours Wednesdays from 4-6 pm, on Zoom, id 459 434 2854. This is the last week for office hours.

I am available for lunch on Mondays at 1 pm in Morse. Last chance today!

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

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

Announcements

Yale Computer Society Article in today's YDN about y/Labs project for Yale research opportunities.

Information Society Project Yale Law School. Weekly Events No more events until the fall.

Bulldog Days: Wednesday, April 23rd

You should plan to attend in person to be available to chat up the prospective first years about CS, Yale, and life after high school. You were once in their shoes.

CS 201 Jeopardy Wednesday, April 23rd

On Wednesday April 23rd, we will have an in class Jeopardy competition. Question topics will include racket, Turing machines, UNIX, boolean functions, and digital circuits and gates. Here is an example in another domain.

Students may compete as individuals or teams. If you wish to compete, send me a note indicating the members of your team.

The members of the winning team get 10 homework points each. The runners-up get 5 homework points each.

Update: winning team gets 15 points. Runners-up get 10 points.

Teams:

Team 1. The 201 Warriors. Lorenzo Chamberlin, Ignacio Montoro Piñeiro, and Gabriel Brown.

Team 2. The Stack Overflowers. Dawn Obot, Sophia Colorado, Obbie Luciano, and Alejandro Zuluaga.

Final Exam: Monday, May 5th, 7pm, Davies

The exam will be three and a half hours long. You should have plenty of time.

Here is a practice exam. (solutions). (final.rkt code for solutions) Ignore questions 1, 6, 7(c), 7(e), and 10. We will cover box and pointer notation. Plus Turing Machines and UNIX, through principle 6, that is, everything. Practice TC-201 programs. solutions. Since TC 201 was not on the second midterm, it will be emphasized on the final.

If your grade on the final exam is higher than your lower midterm grade, it will replace that grade. The quality of mercy is not strained.

Review session: TBA.

SAS students at Watson Center:

Please remind your students to sign up to reserve a space with us through their SAS Accommodate portal:

Lecture: Running Time of Programs.

Runtime.html

tc201sort.pdf experiment with TC-201 sort program. Plotted in google sheets with insert chart.

Professor Ozan Erat lectured on 11/14/22: big-O Asymptotic Analysis

Big-O Cheat Sheet Know Thy Complexities!

Big-O: O(n) function is bounded above. Upper bound. Worst case.
Big-Omega: Ω(n) function is bounded below. Lower bound. Best case.
Big-Theta: Θ(n) function is bounded both above and below. Average case.

Closures + mutators:

Getting to know UNIX

UNIX Introduction Principles 5 and 6. Available as bonus lecture video on Canvas. (It was briefly hidden in Canvas. It is now happily at home in the course media library.)

[Home]