CS 2000 - Fall 2025.


[Home]

Welcome to CS 2000! 10/29/2025

Video of the Day

Socratica Python videos:

Logical problem of the day

The average gait of a pedestrian in a given city can predict which of the following urban statistics: the number of libraries, the length of electrical conduit, or the number of patents filed in that city?

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. Note: each quiz is now worth 5 points.

Click for today's quiz.

Lecture 17: Exceptions + PVM.

Administrivia

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

  • I will be available for lunch on Mondays at 1 pm in Morse.

  • ULA office hours are found at Ed Discussions on Canvas.

  • CS Peer Advisers. Fall 2025 Peer Advisors Office Hours Schedule.

  • Homework assignments: [Assignments]. hw5 is now available. Extension for hw4 to Wednesday, October 29th.

    Announcements

  • Yale Information Society Project See this week's events.

  • Office of Career Services STEMConnect Pop Up advising Fall schedule. Drop in to one and have your resume reviewed, hear advice about finding internships, and learn more about how to get connected to alumni for networking opportunities.

    Midterm Exam II: Thursday November 13th, 7pm, DL 220

    The second midterm will be similar to the first. You will have 2 hours. Here is a sample midterm exam. (solutions) There will also be a question on data structures.

    There will be a UNIX question, as in the first midterm. Here is a sample UNIX transcript (solutions) UNIX will cover through principle 4.

    old review slides

    Data Structures

    DataStructures.html (jupyter) Data Structures.

    There was a question about overflow in the hash function, djb2. On Monday, we discussed this and showed that Python was happy to calculate hash values that were enormous! E.g.,

    >>>
    h.hashfun('abcdefabcdefabcdefdkdkdkdkdkdkdkdkdslslslssl\
    slslslslslslslslsllslslslsllslkdkslslslsldkdkdkdks',True)
    'Hash of:
    abcdefabcdefabcdefdkdkdkdkdkdkdkdkdslslslsslslslslsls\
    lslslslsllslslslsllslkdkslslslsldkdkdkdks
    =
    296086086150504211996300652600047685835977743194174544\
    282835418942403047443099183404852972673613849533884019\
    555092649362921601644660642198201030846
       
    While Python handles integers with arbitrary precision, other operations — such as floating-point arithmetic or external libraries — can still encounter overflow issues. See How to Address Overflow in Python: A Comprehensive Guide

    I recorded a lecture on Friday which covers iterators and decorators.

  • Iterators.html it14()
  • Decorators.html

  • Monday we discussed Exceptions.html Decorators

    Python Virtual Machine

    PVM.html jupyter notebook - Python Virtual Machine and hw5.

  • bytecode.py
  • pvm.py

    Getting to know UNIX

    UNIX Introduction Principle 3.
    [Home]