Applies the Caesar Cipher to self.message_text with the input shift. Creates a new string that is self.message_text shifted down the

Creates a dictionary that can be used to apply a cipher to a letter. The dictionary maps every uppercase and lowercase letter to a

Allows the user to play the given hand, as follows: * The hand is displayed. * The user may input a word or a single period (the string

secretWord: string, the word the user is guessing lettersGuessed: list, what letters have been guessed so far returns: string, comprised

Returns the length (number of letters) in the current hand. hand: dictionary (string int) returns: integer

Returns the score for a word. Assumes the word is a valid word. The score for a word is the sum of the points for letters in the word, m

assumes e is hashable Returns the number of times e occurs in self.

Decrypt self.message_text by trying every possible shift value and find the "best" one. We will define "best" as the shift that

lettersGuessed: list, what letters have been guessed so far returns: string, comprised of letters that represents what letters have not

Returns True if word is in the wordList and is entirely composed of letters in the hand. Otherwise, returns False. Does not mutate hand

secretWord: string, the word the user is guessing lettersGuessed: list, what letters have been guessed so far returns: boolean, True if a

t, tuple Each element of t is either an int, a tuple, or a list No tuple or list is empty Returns the maximum int in t or (r

assumes e is hashable If e occurs in self, reduces the number of times it occurs in self by 1. Otherwise does nothing.

Assumes that 'hand' has all the letters in word. In other words, this assumes that however many times a letter appears in 'word', 'hand'

Initializes a Message object text (string): the message's text a Message object has two attributes:

Initializes a PlaintextMessage object text (string): the message's text shift (integer): the shift associate

Initializes a CiphertextMessage object text (string): the message's text a CiphertextMessage object has two

Assumes center_loc and tent_loc are Location objects Initializes a new Campus centered at location center_loc with a tent at locati

Assumes new_tent_loc is a Location Adds new_tent_loc to the campus only if the tent is at least 0.5 distance away from all other ten

Changes self.shift of the PlaintextMessage and updates other attributes determined by shift (ie. self.encrypting_dict and m

map_from, map_to: strings where each contain N unique lowercase letters. code: string (assume it only contains le

d: dict Returns an inverted dictionary according to the instructions above

Assume n is an int >= 0

Assume n is an int >= 0

L, a list of numbers (n0, n1, n2, ... nk) Returns a function, which when applied to a value x, returns the value n0 * x^k + n1 * x^(k-1) + .

Used to safely access a copy self.encrypting_dict outside of the class Returns: a COPY of self.encrypting_dict

Used to safely access self.message_text outside of the class Returns: self.message_text

Used to safely access self.message_text_encrypted outside of the class Returns: self.message_text_encrypted

Used to safely access self.shift outside of the class Returns: self.shift

Returns a list of all tents on the campus. The list should contain the string representation of the Location of a tent. The list should

Used to safely access a copy of self.valid_words outside of the class Returns: a COPY of self.valid_words

secretWord: string, the secret word to guess. Starts up an interactive game of Hangman. * At the start of the game, let the user know how

assumes e is hashable returns True if e has been inserted in self and not subsequently removed, and False otherwise.

L1 and L2: lists containing integers and strings Returns False if L1 and L2 are not permutations of each other. If they are perm

k, a positive integer returns True if k is triangular and False if not

Assumes L is a non-empty list of ints Returns the largest element of L that occurs an odd number of times in L. If no such element e

L is a list on integers

m is the multiplication factor n is a list.

Allow the user to play an arbitrary number of hands. 1) Asks the user to input 'n' or 'r' or 'e'. * If the user inputs 'n', let the u

Allow the user to play an arbitrary number of hands. 1) Asks the user to input 'n' or 'r' or 'e'. * If the user inputs 'e', immedia

s: the string to convert Finds a version of s without vowels and whose characters appear in the same order they appear in s. Prints this ver

assumes e is hashable If e occurs one or more times in self, reduces the number of times it occurs in self by 1. Otherwise d

Assumes tent_loc is a Location Removes tent_loc from the campus. Raises a ValueError if there is not a tent at tent_loc. Doe

L is a list on integers