Difference between revisions of "User:Djs64"
Line 10: | Line 10: | ||
== Homework 1 Grand Challenge Article == | == Homework 1 Grand Challenge Article == | ||
[http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3080283/ ACS Global Water Initiative: The Grand Challenge Of Water], Bassam Z. Shakhashiri, David L. Sedlak, Jerald L. Schnoor, American Chemistry Society, updated 20 May 2013, accessed 29 August 2014 (Provide access to clean water) | [http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3080283/ ACS Global Water Initiative: The Grand Challenge Of Water], Bassam Z. Shakhashiri, David L. Sedlak, Jerald L. Schnoor, American Chemistry Society, updated 20 May 2013, accessed 29 August 2014 (Provide access to clean water) | ||
+ | |||
+ | |||
+ | == Homework 2 MATLAB Favorite Demonstration == | ||
+ | My favorite demonstration was the "Traveling Salesman" because it seems to perform a very practical and applicable function. Finding the shortest route between a chosen number of cities/locations, this program/demonstration searched through all the possibilities of creating the shortest itinerary in less than a minute. The efficiency and simplicity of this demo stood out to me, once again revealing how powerful computers can be in reliably performing data calculations and related tasks. |
Revision as of 05:28, 1 September 2014
Contents
About Me
Derek Shu is a Duke University student currently in the Pratt School of Engineering. In his free time, he likes to do many things including playing piano, eating, listening to Christian music, and spending time with his fellow Duke undergraduates!
How to Pronounce My Name
His name is fairly straightforward to pronounce correctly. If you are struggling to pronounce it, it rhymes with "Eric Who".
Homework 1 Grand Challenge Article
ACS Global Water Initiative: The Grand Challenge Of Water, Bassam Z. Shakhashiri, David L. Sedlak, Jerald L. Schnoor, American Chemistry Society, updated 20 May 2013, accessed 29 August 2014 (Provide access to clean water)
Homework 2 MATLAB Favorite Demonstration
My favorite demonstration was the "Traveling Salesman" because it seems to perform a very practical and applicable function. Finding the shortest route between a chosen number of cities/locations, this program/demonstration searched through all the possibilities of creating the shortest itinerary in less than a minute. The efficiency and simplicity of this demo stood out to me, once again revealing how powerful computers can be in reliably performing data calculations and related tasks.