Conditional Expressions and Statements : 01/20/2023

Operations on Variables : 01/19/2023

Variables and Types : 01/18/2023

Welcome to CS 124 : 01/17/2023

Practice with Strings

Welcome back!
Our next lesson is entirely focused on one problem: encryption.

We’re going to modify the normal lesson flow.
We’ll start with the homework problem at the top.
If you’d like to just go at on your own, go for it!
And, if you’d like a bit of help, we’ll break it down piece-by-piece below.

Let’s break down this problem into smaller pieces, and spend a few moments just orienting ourselves and figuring out what to do.
We won’t write test cases yet, and instead save them for the smaller pieces that we’re about to create.

Now that we have a sense of what the different pieces are, let’s look at one of the core challenges: remapping each character.
We’ll also write some simple test cases for our helper method.

Remarkably few women have won the Turing Award, the highest award given for contributions to computer science.
(Often considered the Nobel Prize of computing.)
Shafi Goldwasser is one of them.

She received the award in 2012 “for transformative work that laid the complexity-theoretic foundations for the science of cryptography and in the process pioneered new methods for efficient verification of mathematical proofs in complexity theory.”
Her work underlies the foundations of our modern data society, including algorithms that you use every day when you chat, browse, shop, and engage online.
Here’s a short (if somewhat poorly done) official video describing her contributions: