Skip to content

Latest commit

 

History

History
24 lines (16 loc) · 1.07 KB

README.md

File metadata and controls

24 lines (16 loc) · 1.07 KB

Problems from MITx 6.00.1 coursework.

These problem sets were presented to students in case-study format. In certain sets, like pset-4, helper code was provided by instructors. Function and class definitions were given in order to allow for automated grading and provide some degree of scaffholding. The actual programming is left to the students.

pset-1: Control Operators and Iterables.

Task: Write logic that iterates through a string and prints the longest substring of alphabetically ordered characters.

pset-2: Bisectional Search

Task: Write Logic that prompts user to enter a number, and then let the "computer" attempt to guess.

pset-3: Functional Programming

Task: Write a program that imports vocab from a CSV and randomly selects a word to play the game hangman against the computer.

pset-4: More Functional Programming

Task: Build a version of scrabble to let a human play alone then another to play against the computer.

pset-5: Not Saved.

pset-6: Classes

Task: Use classes to build a caesar-cipher object which can encrypt and decrypt a stored message.