Conversation in the car this morning:
R: you should try getting off [the 10-W] on Lincoln, it's closer to the ROC.Just hit me how the Silicon Valley series becomes more and more relevant as I dive deeper into the tech world
Me: oh shoot! Is that your parking search algorithm?
R: -lol- yea, your time complexity is going to be a lot better. Lincoln also has free parking and you can snake around down so you don't overlap streets.
Me: -lol- do you have a for loop for that?
R: nah, I used recursion
Me: what's the base case?
R: if found parking, call function park and walk to ROC.
I bought dinner for Justin today for helping me out when my car was towed. He's a cool guy!
What we did today:
1. Toy Problem: get these scrubby problems outta here!
nthFibonacci
Suppose a newly-born pair of iguanas, one male, one female, are put in a large aquarium.
Iguanas are able to mate at the age of one month so that at the end of its second month a female can produce another pair of iguanas.
Suppose that our iguanas never die and that the female always produces one new pair (one male, one female) every month from the second month on.
How many pairs of iguanas will there be after n months?
For example, the iguana pair size for months zero through five are:
0 1 1 2 3 5
If n were 4, your function should return 3; for 5, it should return 5.
2. Reflect & Feedback session
3. Lecture on chatterbox client
4. Townhall
4. Video lecture on Browser security model
5. Pair programming on chatterbox client
I really liked this sprint because it applies to "real life". By making a chatbox client, we got to learn how information is passed from client to server and back. We discussed URLs, APIs, ajax, http, REST, Postman, and how they contribute to getting websites onto our computer screens. We also got a taste on how to protect our computers with escaping from malicious injections of code.
Gives me good insight on what goes on under the hood on this thing called the internet1.22.16
No comments:
Post a Comment