Here is an essay version of my class notes from Class 1 of CS183: Startup. Errors and omissions are my own. Credit for good stuff is Peter’s entirely.
CS183: Startup—Notes Essay—The Challenge of the Future
Purpose and Preamble
Here is an essay version of my class notes from Class 1 of CS183: Startup. Errors and omissions are my own. Credit for good stuff is Peter’s entirely.
CS183: Startup—Notes Essay—The Challenge of the Future
Purpose and Preamble
| package svnhelpers; | |
| import java.util.ArrayList; | |
| import java.util.Collection; | |
| import org.apache.commons.collections.CollectionUtils; | |
| import org.apache.commons.collections.TransformerUtils; | |
| import org.tmatesoft.svn.core.SVNDirEntry; | |
| import org.tmatesoft.svn.core.SVNException; | |
| import org.tmatesoft.svn.core.SVNURL; |
| """ | |
| Use a Counter to find the most common words in "The Wonderful Wizard of Oz" by | |
| L. Frank Baum. | |
| Available in (mostly) plain text at: | |
| https://archive.org/stream/wonderfulwizardo00baumiala/wonderfulwizardo00baumiala_djvu.txt | |
| Note: This code also counts the words in the header, so it's not a *realistic* | |
| applicaton, but more of a demonstration of python's Counter. |
| <?php | |
| /** | |
| * Converts Roman numbers to integers | |
| */ | |
| class Roman | |
| { | |
| /** | |
| * @var array | |
| */ |
| These are some features. They can be implemented in any order you prefer. | |
| * an elevator responds to calls containing a source floor and direction | |
| * an elevator delivers passengers to requested floors | |
| * an elevator doesn't respond immediately. consider options to simulate time | |
| * elevator calls are queued not necessarily FIFO | |
| * you may validate passenger floor requests | |
| * you may implement current floor monitor | |
| * you may implement direction arrows | |
| * you may implement doors (opening and closing) |
If people want to move, and the leads of those projects deem them qualified, there’s no reason not to allow this.
Deeming someone qualified is a pretty nuanced and difficult process. I wouldn’t expect all or even most temporary tech leads to get it right (or even be close) for a long time.
Bio
Jacob is the world's foremost expert on (within the subset of people who: work in Ruby for a living, surf the Pacific regularly, and brew sour beers). He does all these things in San Francisco California, while working at Engine Yard.
title
| class myStuff implements Runnable{ | |
| /* Collatz conjecture problem: Skiena's Programming Challenges textbook: | |
| * This program accepts two ints representing a range of ints from the robo-judge. | |
| * For each int in the range it peforms the HOTPO operation to produce a hailstone sequence. | |
| * outputs (prints) the first and second ints inputted and the largest hailstone sequence. | |
| * produced from the range | |
| */ | |
| public void run(){ | |
| # 1. Word Scores | |
| def getWordScore(word, n): | |
| return (len(word) * sum(SCRABBLE_LETTER_VALUES[x] for x in word)) + (50 if len(word) == n else 0) | |
| # Test implementation | |
| def getFrequencyDict(aStr): | |
| return dict((letter, aStr.count(letter)) for letter in aStr) | |
| # 2. Dealing with hands | |
| def updateHand(hand, word): |
| # 6.00 Problem Set 3 | |
| # | |
| # Hangman game | |
| # | |
| # ----------------------------------- | |
| # Helper code | |
| # You don't need to understand this helper code, | |
| # but you will have to know how to use the functions | |
| # (so be sure to read the docstrings!) |