CS 201 - Fall 2019.


[Home]

Welcome to CS 201!

Logical problem of the day:

What is the top reason for learning racket? (top ten list)

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

Lecture 38: Final Exam Review 12/6/2019

Administrivia

  • No scheduled office hours during reading period or exams. Please use piazza or email to contact me or the ULAs.

  • Assignment hw8 is available: [Assignments]. hw8 is optional. It is worth 90 points. It can replace your lowest problem set grade. Thus, if you earned 90 or more on all your hw's, you will not get any credit for hw8. Although, it might build your character.

  • Video Tutorials!

    See the CPSC201 Yale channel at Youtube. There are new videos for hw7!

  • Advent of Code Daily programming problems to up your game.

    Final Exam

  • Final exam: Sunday, December 15th, 2pm. SSS 114

  • If your final exam grade is higher than your lower midterm grade, you can replace the lower grade. Note that the final exam is 120 points, and the midterms were 60 points each, so the grades will be scaled accordingly. For example, if you got a 40 and 42 on your midterms and got a 90 on the final, the 40 would be replaced by 45 (half the final grade). The 42 would be unchanged.

  • Here is a practice exam. (solutions). (final.rkt code for solutions) Ignore question 10. Plus Turing Machines and UNIX. Practice TC-201 programs. solutions. Sample UNIX transcript - principle 5 answers Sample UNIX transcript - principle 6 answers

    Getting to know UNIX

    UNIX Introduction

    sleep.txt complexity of sleep sort

    Consider the following four UNIX commands:

    echo expr 4 + 5 | tee xxx1 | source xxx1
    echo expr 4 + 5 | tee xxx2 | sleep 2 | source xxx2
    echo expr 4 + 5 | tee xxx3 | sleep 2 ; source xxx3
    echo expr 4 + 5 > xxx4 | source xxx4
    

    Farewell and Gratitude

    Valedictory Cavafy: Ithaka as read by Sean Connery
    [Home]