Difference between revisions of "User:Cml44"
(4 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
==About Me== | ==About Me== | ||
− | My name is Carly Lutzky | + | My name is Carly Lutzky (pronounced KAR-lee LAHTZ-kee). I am one of the few users on here that is in Trinity, but I want to transfer. I am from Westchester, NY and am a freshman at [http://www.duke.edu/| Duke University]. I am in EGR53 Lab section 9c. Right now, I think I am going to major in [http://www.bme.duke.edu/| Biomedical Engineering]. |
+ | |||
+ | ==Grand Challenges for Engineering== | ||
+ | *Engineer Better Medicine | ||
+ | **[http://www.kettering.edu/visitors/storydetail.jsp?storynum=2432| Engineering better medicine - one bead at a time], Dawn Hibbard, Kettering University, updated 8 Aug 2003,accessed 22 September 2010 (Grand Challanges for Engineering) | ||
+ | |||
+ | ==My favorite demo== | ||
+ | My favorite demo was the traveling salesman. I thought it was really interesting because when the number of cities are low, you can solve it by hand, but as the number of cities increase, the only way to be able to tell which route will be the shortest is either by using an insane amount of calculations, or developing a computer program (such as this one) to make the calculations for you. This demo was a good example of why sometimes it might be easier to spend the initial time creating a program to save you time spent on calculations later on. |
Latest revision as of 17:15, 22 September 2010
About Me
My name is Carly Lutzky (pronounced KAR-lee LAHTZ-kee). I am one of the few users on here that is in Trinity, but I want to transfer. I am from Westchester, NY and am a freshman at Duke University. I am in EGR53 Lab section 9c. Right now, I think I am going to major in Biomedical Engineering.
Grand Challenges for Engineering
- Engineer Better Medicine
- Engineering better medicine - one bead at a time, Dawn Hibbard, Kettering University, updated 8 Aug 2003,accessed 22 September 2010 (Grand Challanges for Engineering)
My favorite demo
My favorite demo was the traveling salesman. I thought it was really interesting because when the number of cities are low, you can solve it by hand, but as the number of cities increase, the only way to be able to tell which route will be the shortest is either by using an insane amount of calculations, or developing a computer program (such as this one) to make the calculations for you. This demo was a good example of why sometimes it might be easier to spend the initial time creating a program to save you time spent on calculations later on.