1 / 13

Educating Tomorrow’s Algorithmic Problem-Solvers

Educating Tomorrow’s Algorithmic Problem-Solvers. Pierre Bierre , Algorithmic Geometry course developer AlgoGeom.org, founder. Robb Cutler , co-founder, Computer Science Teachers Association (CSTA) Tutor Crossing, founder.

ashley
Télécharger la présentation

Educating Tomorrow’s Algorithmic Problem-Solvers

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Educating Tomorrow’s Algorithmic Problem-Solvers Pierre Bierre, Algorithmic Geometry course developer AlgoGeom.org, founder Robb Cutler, co-founder, Computer Science Teachers Association (CSTA) Tutor Crossing, founder February 10, 2009SUSE ED291 Symposium

  2. What is meant by “computer-science fluency”? What is CSTA’s plan impart it broadly via a K-12 model curriculum? What might be the impact on your educational topic of interest? 25:00 Robb - CSTA’s vision for computer science education 25:00 Pierre - reshaping geometry for algorithmic thinkers (grade 11-12) 20:00 Q/A, roundtable discussion Today’s outline

  3. What is meant by “computer-science fluency”? What is CSTA’s plan impart it broadly via a K-12 model curriculum? What will be the impact on your subjects of interest? 25:00 Robb - CSTA’s vision for computer science education 25:00 Pierre - reshaping geometry for algorithmic thinkers (grade 11-12) 20:00 Q/A, roundtable discussion Today’s outline

  4. Robb Cutler presentation

  5. Algorithmic Geometry Pierre Bierre: degrees in physics, CS, Stanford Neuropsychology 4 years,biotech data analysis & robotics 15 years, inventor recognized by Modern Marvels 2007 Why algorithmic geometry? The most powerful medium for solving spatial problems is a blend of paper & pencil + software programming Geometry theory is bending as a result of working in the new medium High school students deserve up-to-date, relevant math-CS education Hart-Rudman Commission said to compete globally via math education

  6. Algorithmic Geometry What is it? Spatial problem-solving done as a human-machine partnership human computer - + creativity - + stamina understandmeaning + - error-free arithmetic - + handle exceptions + - computationalspeed - + Want geometry concepts that make it easy to delegate work to computer

  7. ∞ n / 0 = error! [ x y ] slope = dy / dx use direction vector [ x y ] use angle qto represent 2D direction use direction vector [ x y ] use angles [ fq ]to represent 3D direction use direction vector [ x y z ] “=“ sign used ambiguously a == b (comparison) b a (info copying) trigonometry don’t use anymore handle pedagogic cases handle all cases closed-form solution number-crunching algorithm pages of complex equations layering of small, bite-sized algos Examples of conceptual shifts Pre-computational Algorithmic

  8. h r1 r2 el “home” position of motors qsh== 0 qel == 0 sh Degree-of-difficulty of algorithmic geometry problems 2D robot arm motor coordination Given:shoulder location sh upper-arm length r1 forearm length r2 desired reach-point h,solve for motor angles [qsh qel ]

  9. Degree-of-difficulty of algorithmic geometry problems 3D sphere-circle intersection Problem: solve intersection of sphere and circle3D SPH i2 CIR i1 Given SPH = [ c r ] CIR = [ c orient r ] Compute Results numIntersectionPoints ( 0, 1, 2, ∞ ) point locations i1i2

  10. Problem statement Sketch out a mental solution 0: dist (c1, c2) > r1 + r2 Write pseudocode if (Vec2.distance(C1.c, C2.c) Translate algo into Java Test algo graphically algo library Problem-solving methodology

  11. Algorithmic Geometry - Project development path Milestone Done? syllabus / coursebook drafted 2004 course lab software (2D module) 2005 proof-of-concept pilot course (72 h) 2005 NSF grant proposals 2006-7-8 NCTM presentation 2008 course lab software (3D module) 2008-9 Summer ‘09 course announced 2009 Learning metrics design/capture 2009 Teach-the teachers feasibility 2009-12 Technical expert reviews 2009-12 First 150 student outcomes 2012

  12. Potential benefits Spatial problem-solving proficiency of students could be raised to a collegiate or grad-student level before leaving high school Redefine math-problem mastery as ability to devise an automated solution Influence more young people to consider STEM careers during the critical decision timeframe (grades 11-12), especially girls, under-represented groups “Seed” next generation of scientists-engineers with sophisticated, operationalunderstanding of 3D geometry applicable to their specialties Uphill challenges Student performance elevated beyond level measurable along standard yardsticks (e.g. SAT, TIMSS, NAEPS)…. will “accountability” crowd buy in? Is is math or computer science? (it’s both) NSF 9-12 ed research seriously underfunded and somewhat risk-averse Project could move ahead faster as an academic-industry partnership Algorithmic Geometry summary

  13. Educating Tomorrow’s Algorithmic Problem-Solvers Q/A - roundtable discussion Follow-up: Pierre Bierre pierre@AlgoGeom.org (White paper on Algo Geom)Robb Cutler robb@tutorcrossing.com www.tutorcrossing.com

More Related