Difference between revisions of "User:Bil2"
Jump to navigation
Jump to search
| Line 2: | Line 2: | ||
My name is Brian Li, I am a freshman in the class of 2021 at Duke, and I love sports and food! | My name is Brian Li, I am a freshman in the class of 2021 at Duke, and I love sports and food! | ||
| + | |||
| + | == Grand Challenges == | ||
| + | |||
| + | [https://borgenproject.org/how-to-provide-access-to-clean-water/ How to Provide Access to Clean Water in Innovative Ways], Rick DelVecchio, SFGate, 13 May 2006, accessed 21 September 2017 (Access to Clean Water) | ||
== Favorite Demonstration == | == Favorite Demonstration == | ||
The "Traveling Salesman" demonstration was particularly interesting to me due to the fact that the user could pick any number of cities and the program could simultaneously find the most direct path to each one. This could simulate a simplified version of airplane navigation systems and how they are coded for the quickest flight paths, and this is pretty fascinating to me given I like engineering and flying planes. | The "Traveling Salesman" demonstration was particularly interesting to me due to the fact that the user could pick any number of cities and the program could simultaneously find the most direct path to each one. This could simulate a simplified version of airplane navigation systems and how they are coded for the quickest flight paths, and this is pretty fascinating to me given I like engineering and flying planes. | ||
Latest revision as of 14:26, 21 September 2017
About Me
My name is Brian Li, I am a freshman in the class of 2021 at Duke, and I love sports and food!
Grand Challenges
How to Provide Access to Clean Water in Innovative Ways, Rick DelVecchio, SFGate, 13 May 2006, accessed 21 September 2017 (Access to Clean Water)
Favorite Demonstration
The "Traveling Salesman" demonstration was particularly interesting to me due to the fact that the user could pick any number of cities and the program could simultaneously find the most direct path to each one. This could simulate a simplified version of airplane navigation systems and how they are coded for the quickest flight paths, and this is pretty fascinating to me given I like engineering and flying planes.
