DOCSLIB.ORG

Recursion with Turtles Use from Turtle Import * to Use These Commands

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Recursion with Turtles Use from Turtle Import * to Use These Commands Turtle Graphics Python has a built-in module named turtle. See the Python turtle module API for details. Recursion with Turtles Use from turtle import * to use these commands: fd(dist) turtle moves forward by dist bk(dist) turtle moves backward by dist lt(angle) turtle turns left angle degrees rt(angle) turtle turns right angle degrees pu() (pen up) turtle raises pen in belly pd() (pen down) turtle lower pen in belly pensize(width) sets the thickness of turtle's pen to width CS111 Computer Programming pencolor(color) sets the color of turtle's pen to color shape(shp) sets the turtle's shape to shp Department of Computer Science home() turtle returns to (0,0) (center of screen) Wellesley College clear() delete turtle drawings; no change to turtle's state reset() delete turtle drawings; reset turtle's state setup(width,height) create a turtle window of given width and height 10-2 A Simple Example with Turtles Looping Turtles from turtle import * Loops can be used in conjunction with turtles to make interesting designs. setup(400,400) fd(100) # Draws a polygon with the specified number lt(60) # of sides, each with the specified length shape('turtle') def polygon(numSides, sideLength): pencolor('red') fd(150) rt(15) pencolor('blue') bk(100) pu() polygon(4,100) polygon(6,60) polygon(100,3) bk(50) pd() pensize(5) bk(250) pensize(1) home() 10-3 10-4 polygon(3,100) polygon(5,75) polygon(7,50) Looping Turtles Spiraling Turtles: A Recursion Example # Draws "flowers" with numPetals arranged around # a center point. Each petal is a polygon with # petalSides sides of length petalLen. def polyFlow(numPetals, petalSides, petalLen): spiral(200,90,0.9,10) spiral(200,72,0.97,10) spiral(200,80,0.95,10) polyFlow(7,4,80) polyFlow(10,5,75) polyFlow(11,6,60) spiral(200,121,0.95,15) spiral(200,95,0.93,10) 10-5 10-6 spiral(sideLen, angle, scaleFactor, minLength) Spiraling Turtles: A Recursion Example • sideLen is the length of the current side • angle is the amount the turtle turns left to draw the def spiral(sideLen, angle, scaleFactor, minLength): next side • scaleFactor is the multiplicative factor by which to scale the next side (it is between 0.0 and 1.0) • minLength is the smallest side length that the turtle will draw 400 spiral(625, 90, 0.8, 250) 320 500 256 625 10-7 10-8 spiral(625, 90, 0.8, 250) spiral(625, 90, 0.8, 250) spiral(625, 90, 0.8, 250) if sideLen >= minLength: fd(sideLen) lt(angle) spiral(sideLen*scaleFactor, angle, scaleFactor, minLength) 10-9 10-10 spiral(625, 90, 0.8, 250) spiral(625, 90, 0.8, 250) 625 spiral(625, 90, 0.8, 250) spiral(625, 90, 0.8, 250) if True: if True: fd(sideLen) fd(625) lt(angle) lt(angle) spiral(sideLen*scaleFactor, angle, spiral(sideLen*scaleFactor, angle, scaleFactor, minLength) scaleFactor, minLength) 10-11 10-12 spiral(625, 90, 0.8, 250) spiral(625, 90, 0.8, 250) 625 625 spiral(625, 90, 0.8, 250) spiral(625, 90, 0.8, 250) if True: if True: fd(625) fd(625) lt(90) lt(90) spiral(sideLen*scaleFactor, angle, spiral(500, 90, scaleFactor, minLength) 0.8, 250) spiral(500, 90, 0.8, 250) if sideLen >= minLength: fd(sideLen) lt(angle) spiral(sideLen*scaleFactor, angle, scaleFactor, minLength) 10-13 10-14 spiral(625, 90, 0.8, 250) spiral(625, 90, 0.8, 250) 500 625 625 spiral(625, 90, 0.8, 250) spiral(625, 90, 0.8, 250) if True: if True: fd(625) fd(625) lt(90) lt(90) spiral(500, 90, spiral(500, 90, 0.8, 250) 0.8, 250) spiral(500, 90, 0.8, 250) spiral(500, 90, 0.8, 250) if True: if True: fd(sideLen) fd(500) lt(angle) lt(angle) spiral(sideLen*scaleFactor, angle, spiral(sideLen*scaleFactor, angle, scaleFactor, minLength) scaleFactor, minLength) 10-15 10-16 spiral(625, 90, 0.8, 250) 500 spiral(625, 90, 0.8, 250) 500 625 625 spiral(625, 90, 0.8, 250) spiral(625, 90, 0.8, 250) if True: if True: fd(625) fd(625) lt(90) lt(90) spiral(500, 90, spiral(500, 90, 0.8, 250) 0.8, 250) spiral(500, 90, 0.8, 250) spiral(500, 90, 0.8, 250) if True: if True: fd(500) fd(500) lt(90) lt(90) spiral(sideLen*scaleFactor, angle, spiral(400, 90, scaleFactor, minLength) 0.8, 250) spiral(400, 90, 0.8, 250) if sideLen >= minLength: fd(sideLen) lt(angle) spiral(sideLen*scaleFactor, angle, 10-17 scaleFactor, minLength) 10-18 400 spiral(625, 90, 0.8, 250) 500 spiral(625, 90, 0.8, 250) 500 625 625 spiral(625, 90, 0.8, 250) spiral(625, 90, 0.8, 250) if True: if True: fd(625) fd(625) lt(90) lt(90) spiral(500, 90, spiral(500, 90, 0.8, 250) 0.8, 250) spiral(500, 90, 0.8, 250) spiral(500, 90, 0.8, 250) if True: if True: fd(500) fd(500) lt(90) lt(90) spiral(400, 90, spiral(400, 90, 0.8, 250) 0.8, 250) spiral(400, 90, 0.8, 250) spiral(400, 90, 0.8, 250) if True: if True: fd(sideLen) fd(400) lt(angle) lt(angle) spiral(sideLen*scaleFactor, angle, spiral(sideLen*scaleFactor, angle, scaleFactor, minLength) 10-19 scaleFactor, minLength) 10-20 400 400 spiral(625, 90, 0.8, 250) 500 spiral(625, 90, 0.8, 250) 500 625 625 spiral(625, 90, 0.8, 250) spiral(625, 90, 0.8, 250) if True: if True: fd(625) fd(625) lt(90) lt(90) spiral(500, 90, spiral(500, 90, 0.8, 250) 0.8, 250) spiral(500, 90, 0.8, 250) spiral(500, 90, 0.8, 250) if True: if True: fd(500) fd(500) lt(90) lt(90) spiral(400, 90, spiral(400, 90, 0.8, 250) 0.8, 250) spiral(400, 90, 0.8, 250) spiral(400, 90, 0.8, 250) spiral(320, 90, 0.8, 250) if True: if True: if sideLen >= minLength: fd(400) fd(400) fd(sideLen) lt(90) lt(90) lt(angle) spiral(sideLen*scaleFactor, angle, spiral(320, 90, spiral(sideLen*scaleFactor, angle, scaleFactor, minLength) 10-21 0.8, 250) scaleFactor, minLength)10-22 400 400 320 spiral(625, 90, 0.8, 250) 500 spiral(625, 90, 0.8, 250) 500 625 625 spiral(625, 90, 0.8, 250) spiral(625, 90, 0.8, 250) if True: if True: fd(625) fd(625) lt(90) lt(90) spiral(500, 90, spiral(500, 90, 0.8, 250) 0.8, 250) spiral(500, 90, 0.8, 250) spiral(500, 90, 0.8, 250) if True: if True: fd(500) fd(500) lt(90) lt(90) spiral(400, 90, spiral(400, 90, 0.8, 250) 0.8, 250) spiral(400, 90, 0.8, 250) spiral(320, 90, 0.8, 250) spiral(400, 90, 0.8, 250) spiral(320, 90, 0.8, 250) if True: if True: if True: if True: fd(400) fd(sideLen) fd(400) fd(320) lt(90) lt(angle) lt(90) lt(angle) spiral(320, 90, spiral(sideLen*scaleFactor, angle, spiral(320, 90, spiral(sideLen*scaleFactor, angle, 0.8, 250) scaleFactor, minLength)10-23 0.8, 250) scaleFactor, minLength)10-24 400 400 320 320 spiral(625, 90, 0.8, 250) 500 spiral(625, 90, 0.8, 250) 500 625 625 spiral(625, 90, 0.8, 250) spiral(625, 90, 0.8, 250) if True: if True: fd(625) fd(625) lt(90) lt(90) spiral(500, 90, spiral(500, 90, 0.8, 250) 0.8, 250) spiral(500, 90, 0.8, 250) spiral(500, 90, 0.8, 250) spiral(256, 90, 0.8, 250) if True: if True: if sideLen >= minLength: fd(500) fd(500) fd(sideLen) lt(90) lt(90) lt(angle) spiral(400, 90, spiral(400, 90, spiral(sideLen*scaleFactor, angle, 0.8, 250) 0.8, 250) scaleFactor, minLength) spiral(400, 90, 0.8, 250) spiral(320, 90, 0.8, 250) spiral(400, 90, 0.8, 250) spiral(320, 90, 0.8, 250) if True: if True: if True: if True: fd(400) fd(320) fd(400) fd(320) lt(90) lt(90) lt(90) lt(90) spiral(320, 90, spiral(sideLen*scaleFactor, angle, spiral(320, 90, spiral(256, 90, 0.8, 250) scaleFactor, minLength)10-25 0.8, 250) 0.8, 250) 10-26 400 400 320 320 500 500 spiral(625, 90, 0.8, 250) spiral(625, 90, 0.8, 250) 256 625 625 spiral(625, 90, 0.8, 250) spiral(625, 90, 0.8, 250) if True: if True: fd(625) fd(625) lt(90) lt(90) spiral(500, 90, spiral(500, 90, 0.8, 250) 0.8, 250) spiral(500, 90, 0.8, 250) spiral(256, 90, 0.8, 250) spiral(500, 90, 0.8, 250) spiral(256, 90, 0.8, 250) if True: if True: if True: if True: fd(500) fd(sideLen) fd(500) fd(256) lt(90) lt(angle) lt(90) lt(angle) spiral(400, 90, spiral(sideLen*scaleFactor, angle, spiral(400, 90, spiral(sideLen*scaleFactor, angle, 0.8, 250) scaleFactor, minLength) 0.8, 250) scaleFactor, minLength) spiral(400, 90, 0.8, 250) spiral(320, 90, 0.8, 250) spiral(400, 90, 0.8, 250) spiral(320, 90, 0.8, 250) if True: if True: if True: if True: fd(400) fd(320) fd(400) fd(320) lt(90) lt(90) lt(90) lt(90) spiral(320, 90, spiral(256, 90, spiral(320, 90, spiral(256, 90, 0.8, 250) 0.8, 250) 10-27 0.8, 250) 0.8, 250) 10-28 400 400 320 320 500 500 spiral(625, 90, 0.8, 250) 256 spiral(625, 90, 0.8, 250) 256 625 625 spiral(625, 90, 0.8, 250) spiral(625, 90, 0.8, 250) spiral(204.8, 90, 0.8, 250) if True: if True: if sideLen >= minLength: fd(625) fd(625) fd(sideLen) lt(90) lt(90) lt(angle) spiral(500, 90, spiral(500, 90, spiral(sideLen*scaleFactor, angle, 0.8, 250) 0.8, 250) scaleFactor, minLength) spiral(500, 90, 0.8, 250) spiral(256, 90, 0.8, 250) spiral(500, 90, 0.8, 250) spiral(256, 90, 0.8, 250) if True: if True: if True: if True: fd(500) fd(256) fd(500) fd(256) lt(90) lt(90) lt(90) lt(90) spiral(400, 90, spiral(sideLen*scaleFactor, angle, spiral(400, 90, spiral(204.8, 90, 0.8, 250) scaleFactor, minLength) 0.8, 250) 0.8, 250) spiral(400, 90, 0.8, 250) spiral(320, 90, 0.8, 250) spiral(400, 90, 0.8, 250) spiral(320, 90, 0.8, 250) if True: if True: if True: if True: fd(400) fd(320) fd(400) fd(320) lt(90) lt(90) lt(90) lt(90) spiral(320, 90, spiral(256, 90, spiral(320, 90, spiral(256, 90, 0.8, 250) 0.8, 250) 10-29 0.8, 250) 0.8, 250) 10-30 400 400 320 320 500 500 spiral(625, 90, 0.8, 250) 256 spiral(625, 90, 0.8, 250) 256 625 625 spiral(625, 90, 0.8, 250) spiral(204.8, 90, 0.8, 250) spiral(625, 90, 0.8, 250) if True: if False: if True: fd(625) fd(sideLen) fd(625) lt(90) lt(angle) lt(90) spiral(500, 90, spiral(sideLen*scaleFactor, angle, spiral(500, 90, 0.8, 250) scaleFactor, minLength) 0.8, 250) spiral(500, 90, 0.8, 250) spiral(256, 90, 0.8, 250) spiral(500, 90, 0.8, 250) spiral(256, 90, 0.8, 250) if True: if True:
Load more

Recommended publications
  • Hal Abelson Education: Princeton AB (Summa Cum Laude)
    Hal Abelson Education: Princeton A.B. (summa cum laude) 1969 MIT Ph.D. (Mathematics) 1973 Professional Appointments: 1994–present MIT Class of 1922 Professor MIT 1991–present Full Professor of Computer Sci. and Eng. MIT 1982–1991 Associate Professor of Electrical Eng. and Computer Sci. MIT 1979–1982 Associate Professor, Dept. of EECS and Division for Study and Res. in Education MIT 1977–1979 Assistant Professor, Dept. of EECS and DSRE MIT 1974–1979 Lecturer, Dept. of Mathematics and DSRE MIT 1974–1979 Instructor, Dept. of Mathematics and DSRE MIT Selected publications relevant to this proposal: 1. “Transparent Accountable Data Mining: New Strategies for Privacy Protection,” with T. Berners- Lee, C. Hanson, J, Hendler, L. Kagal, D. McGuinness, G.J. Sussman, K. Waterman, and D. Weitzner. MIT CSAIL Technical Report, 2006-007, January 2006. 2. “Information Accountability,” with Daniel J. Weitzner, Tim Berners-Lee, Joan Feigenbaum, James Hendler, and Gerald Jay Sussman, MIT CSAIL Technical Report, 2007-034, June 2007. Available at http://hdl.handle.net/1721.1/37600. 3. “The Creation of OpenCourseWare at MIT,” J. Science Education and Technology, May, 2007. 4. Structure and Interpretation of Computer Programs, Hal Abelson, Gerald Jay Sussman and Julie Sussman, MIT Press and McGraw-Hill, 1985, (published translations in French, Polish, Chinese, Japanese, Spanish, and German). Second Edition, 1996. 5. “The Risks of Key Recovery, Key Escrow, and Trusted Third-Party Encryption,” with Ross Ander- son, Steven Bellovin, Josh Benaloh, Matt Blaze, Whitfield Diffie, John Gilmore, Peter Neumann, Ronald Rivest, Jeffrey Schiller, and Bruce Schneier, in World Wide Web Journal, vol. 2, no.
    [Show full text]
  • Fostering Learning in the Networked World: the Cyberlearning Opportunity and Challenge
    Inquiries or comments on this report may be directed to the National Science Foundation by email to: [email protected] “Any opinions, findings, conclusions and recommendations expressed in this report are those of the Task Force and do not necessarily reflect or represent the views of the National Science Foundation.” Fostering Learning in the Networked World: The Cyberlearning Opportunity and Challenge A 21st Century Agenda for the National Science Foundation1 Report of the NSF Task Force on Cyberlearning June 24, 2008 Christine L. Borgman (Chair), Hal Abelson, Lee Dirks, Roberta Johnson, Kenneth R. Koedinger, Marcia C. Linn, Clifford A. Lynch, Diana G. Oblinger, Roy D. Pea, Katie Salen, Marshall S. Smith, Alex Szalay 1 We would like to acknowledge and give special thanks for the continued support and advice from National Science Foundation staff Daniel Atkins, Cora Marrett, Diana Rhoten, Barbara Olds, and Jim Colby. Andrew Lau of the University of California at Los Angeles provided exceptional help and great spirit in making the distributed work of our Task Force possible. Katherine Lawrence encapsulated the Task Force’s work in a carefully crafted Executive Summary. Fostering Learning in the Networked World: The Cyberlearning Opportunity and Challenge A 21st Century Agenda for the National Science Foundation Science Foundation the National for A 21st Century Agenda Report of the NSF Task Force on Cyberlearning Table of Contents Executive Summary...............................................................................................................................................................................................................................5
    [Show full text]
  • A Critique of Abelson and Sussman Why Calculating Is Better Than
    A critique of Abelson and Sussman - or - Why calculating is better than scheming Philip Wadler Programming Research Group 11 Keble Road Oxford, OX1 3QD Abelson and Sussman is taught [Abelson and Sussman 1985a, b]. Instead of emphasizing a particular programming language, they emphasize standard engineering techniques as they apply to programming. Still, their textbook is intimately tied to the Scheme dialect of Lisp. I believe that the same approach used in their text, if applied to a language such as KRC or Miranda, would result in an even better introduction to programming as an engineering discipline. My belief has strengthened as my experience in teaching with Scheme and with KRC has increased. - This paper contrasts teaching in Scheme to teaching in KRC and Miranda, particularly with reference to Abelson and Sussman's text. Scheme is a "~dly-scoped dialect of Lisp [Steele and Sussman 19781; languages in a similar style are T [Rees and Adams 19821 and Common Lisp [Steele 19821. KRC is a functional language in an equational style [Turner 19811; its successor is Miranda [Turner 1985k languages in a similar style are SASL [Turner 1976, Richards 19841 LML [Augustsson 19841, and Orwell [Wadler 1984bl. (Only readers who know that KRC stands for "Kent Recursive Calculator" will have understood the title of this There are four language features absent in Scheme and present in KRC/Miranda that are important: 1. Pattern-matching. 2. A syntax close to traditional mathematical notation. 3. A static type discipline and user-defined types. 4. Lazy evaluation. KRC and SASL do not have a type discipline, so point 3 applies only to Miranda, Philip Wadhr Why Calculating is Better than Scheming 2 b LML,and Orwell.
    [Show full text]
  • The Computer As a Teaching Tool: Promising Practices. Conference Report (Cambridge, Massachusetts, July 12-13, 1984)
    DOCUMENT RESUME ED 295 g'6 IR 013 322 AUTHOR McDonald, Joseph P.; And Others TITLE The Computer as a Teaching Tool: Promising Practices. Conference Report (Cambridge, Massachusetts, July 12-13, 1984). CR85-10. INSTITUTION Educational Technology Center, Cambridge, MA. SPONS AGENCY Education Collaborative for Greater Boston, Inc., Cambridge, Mass. PUB DATE Apr 85 NOTE 25p.; For a report of a related conference, see IR 013 326. PUB TYPE Collected Works - Conference Proceedings (021) -- Reports - Descriptive (141) EDRS PRICE MF01/PC01 Plus Postage. DESCRIPTORS *Computer Assisted Instruction; *Computer Literacy; Computer Simulation; Curriculum Development; Elementrry Secondary Education; *Language Arts; *Mathematics Instruction; Microcomputers; Professional Development; Research Needs; *Science Instruction; Teacher Education; Teacher Role IDENTIFIERS Reality ABSTRACT This report of a 1984 conference on the computer as a teaching tool provides summaries of presentations on the role of the computer in the teaching of science, mathematics, computer literacy, and language arts. Analyses of themes emerging from the conference are then presented under four headings: (1) The Computer and the Curriculum (the computer keeps learning connected to experience; the computer provides access to the underlying disciplines of subjects; the computer challenges the curricular status quo; and the computer aids implementation of the curriculum); (2) The Computer and Reality (computer-based models and simulations only imperfectly represent reality; a program may mask operations that students should experience to give depth and stability to their learning; and computers sometimes need to be used in conjunction with other, more concrete, experiences); (3) Perspectives on Teaching Practice (teaching is rooted in a teacher's own interests, need to understand, and social commitment; and teaching is, to a significant extent, a product of circumstance, not an entirely rational enterprise); and (4) Teachers' Professional Development (strategies and goals are needed for teacher training).
    [Show full text]
  • Computer Science Logo Style Beyond Programming
    Computer Science Logo Style Beyond Programming Brian Harvey Computer Science Logo Style SECOND EDITION Volume 3 Beyond Programming The MIT Press Cambridge, Massachusetts London, England 1997 by the Massachusetts Institute of Technology The Logo programs in this book are copyright 1997 by Brian Harvey. These programs are free software; you can redistribute them and/or modify them under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. These programs are distributed in the hope that they will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License (printed in the ®rst volume of this series) for more details. For information on program diskettes for PC and Macintosh, please contact the Marketing Department, The MIT Press, 55 Hayward Street, Cambridge, Massachusetts, 02142. Copyright credits for quoted material on page 349. This book was typeset in the Baskerville typeface. The cover art is an untitled mixed media acrylic monotype by San Francisco artist Jon Rife, copyright 1994 by Jon Rife and reproduced by permission of the artist. Library of Congress Cataloging-in-Publication Data Harvey, Brian, 1949± Computer Science Logo Style / Brian Harvey. Ð 2nd ed. p. cm. Includes indexes. Contents: v. 1. Symbolic computing. Ð v. 2. Advanced techniques Ð v. 3. Beyond programming. ISBN 0±262±58151±5 (set : pbk. : alk. paper). Ð ISBN 0±262±58148±5 (v. 1 : pbk. : alk. paper). Ð ISBN 0±262±58149±3 (v.
    [Show full text]
  • Free As in Freedom (2.0): Richard Stallman and the Free Software Revolution
    Free as in Freedom (2.0): Richard Stallman and the Free Software Revolution Sam Williams Second edition revisions by Richard M. Stallman i This is Free as in Freedom 2.0: Richard Stallman and the Free Soft- ware Revolution, a revision of Free as in Freedom: Richard Stallman's Crusade for Free Software. Copyright c 2002, 2010 Sam Williams Copyright c 2010 Richard M. Stallman Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled \GNU Free Documentation License." Published by the Free Software Foundation 51 Franklin St., Fifth Floor Boston, MA 02110-1335 USA ISBN: 9780983159216 The cover photograph of Richard Stallman is by Peter Hinely. The PDP-10 photograph in Chapter 7 is by Rodney Brooks. The photo- graph of St. IGNUcius in Chapter 8 is by Stian Eikeland. Contents Foreword by Richard M. Stallmanv Preface by Sam Williams vii 1 For Want of a Printer1 2 2001: A Hacker's Odyssey 13 3 A Portrait of the Hacker as a Young Man 25 4 Impeach God 37 5 Puddle of Freedom 59 6 The Emacs Commune 77 7 A Stark Moral Choice 89 8 St. Ignucius 109 9 The GNU General Public License 123 10 GNU/Linux 145 iii iv CONTENTS 11 Open Source 159 12 A Brief Journey through Hacker Hell 175 13 Continuing the Fight 181 Epilogue from Sam Williams: Crushing Loneliness 193 Appendix A { Hack, Hackers, and Hacking 209 Appendix B { GNU Free Documentation License 217 Foreword by Richard M.
    [Show full text]
  • Logo Tree Project
    LOGO TREE PROJECT Written by P. Boytchev e-mail: pavel2008-AT-elica-DOT-net Rev 1.82 July, 2011 We’d like to thank all the people all over the globe and all over the alphabet who helped us build the Logo Tree: A .........Daniel Ajoy, Eduardo de Antueno, Hal Abelson B .........Andrew Begel, Carl Bogardus, Dominique Bille, George Birbilis, Ian Bicking, Imre Bornemisza, Joshua Bell, Luis Belmonte, Vladimir Batagelj, Wayne Burnett C .........Charlie, David Costanzo, John St. Clair, Loïc Le Coq, Oliver Schmidt-Chevalier, Paul Cockshott D .........Andy Dent, Kent Paul Dolan, Marcelo Duschkin, Mike Doyle E..........G. A. Edgar, Mustafa Elsheikh, Randall Embry F..........Damien Ferey, G .........Bill Glass, Jim Goebel, H .........Brian Harvey, Jamie Hunter, Jim Howe, Markus Hunke, Rachel Hestilow I........... J..........Ken Johnson K .........Eric Klopfer, Leigh Klotz, Susumu Kanemune L..........Janny Looyenga, Jean-François Lucas, Lionel Laské, Timothy Lipetz M.........Andreas Micheler, Bakhtiar Mikhak, George Mills, Greg Michaelson, Lorenzo Masetti, Michael Malien, Sébastien Magdelyns, Silvano Malfatti N .........Chaker Nakhli ,Dani Novak, Takeshi Nishiki O ......... P..........Paliokas Ioannis, U. B. Pavanaja, Wendy Petti Q ......... R .........Clem Rutter, Emmanuel Roche S..........Bojidar Sendov, Brian Silverman, Cynthia Solomon, Daniel Sanderson, Gene Sullivan, T..........Austin Tate, Gary Teachout, Graham Toal, Marcin Truszel, Peter Tomcsanyi, Seth Tisue, Gene Thail U .........Peter Ulrich V .........Carlo Maria Vireca, Álvaro Valdes W.........Arnie Widdowson, Uri Wilensky X ......... Y .........Andy Yeh, Ben Yates Z.......... Introduction The main goal of the Logo Tree project is to build a genealogical tree of new and old Logo implementations. This tree is expected to clearly demonstrate the evolution, the diversity and the vitality of Logo as a programming language.
    [Show full text]
  • The Internet of Education: What Role for Education Research?
    The Internet of Education: What role for Education Research? Richard Noss London Knowledge Lab | Institute of Education University of London lkl.ac.uk What do you think of western civilisation? What do you think of western civilisation? I think it would be a good idea! What do you think of western civilisation? I think it would be a good idea! What do you think of technology in education? Seymour Papert’s contribution Thanks to Hal Abelson Programming Lisp Logo Imagine NetLogo Scratch… • constructionism • people learn best by making things and sharing them • people learn best by making things and sharing them • people learn well if they care about what they’re learning • people learn best by making things and sharing them • people learn well if they care about what they’re learning • let’s not only make new ways to learn, let’s make new things for learning • people learn best by making things and sharing them • [Kahn] takes a dim view of the constructionist idea that students won’t really understand math unless they discover each principle on their own. “Isaac Newton would not have invented calculus had he not had textbooks on algebra.” • [Kahn] takes a dim view of the constructionist idea that students won’t really understand math unless they discover each principle on their own. “Isaac Newton would not have invented calculus had he not had textbooks on algebra.” • Bill Gates is even more scathing: “It’s bullshit,” he says. “If you can’t do multiplication, then tell me, what is your contribution to society going to be?” technology technology
    [Show full text]
  • Siu-Cheung Kong Harold Abelson Editors
    Siu-Cheung Kong Harold Abelson Editors Computational Thinking Education Computational Thinking Education Siu-Cheung Kong • Harold Abelson Editors Computational Thinking Education Editors Siu-Cheung Kong Harold Abelson Department of Mathematics Computer Science and Artificial and Information Technology Intelligence Laboratory The Education University of Hong Kong Massachusetts Institute of Technology Hong Kong, Hong Kong Cambridge, MA, USA ISBN 978-981-13-6527-0 ISBN 978-981-13-6528-7 (eBook) https://doi.org/10.1007/978-981-13-6528-7 Library of Congress Control Number: 2019931527 © The Editor(s) (if applicable) and The Author(s) 2019. This book is an open access publication. Open Access This book is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adap- tation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made. The images or other third party material in this book are included in the book’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the book’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publi- cation does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use.
    [Show full text]
  • Essentials of Programming Languages Third Edition Daniel P
    computer science/programming languages PROGRAMMING LANGUAGES ESSENTIALS OF Essentials of Programming Languages third edition Daniel P. Friedman and Mitchell Wand ESSENTIALS OF This book provides students with a deep, working understanding of the essential concepts of program- ming languages. Most of these essentials relate to the semantics, or meaning, of program elements, and the text uses interpreters (short programs that directly analyze an abstract representation of the THIRD EDITION program text) to express the semantics of many essential language elements in a way that is both clear PROGRAMMING and executable. The approach is both analytical and hands-on. The book provides views of program- ming languages using widely varying levels of abstraction, maintaining a clear connection between the high-level and low-level views. Exercises are a vital part of the text and are scattered throughout; the text explains the key concepts, and the exercises explore alternative designs and other issues. The complete LANGUAGES Scheme code for all the interpreters and analyzers in the book can be found online through The MIT Press website. For this new edition, each chapter has been revised and many new exercises have been added. Significant additions have been made to the text, including completely new chapters on modules and continuation-passing style. Essentials of Programming Languages can be used for both graduate and un- dergraduate courses, and for continuing education courses for programmers. Daniel P. Friedman is Professor of Computer Science at Indiana University and is the author of many books published by The MIT Press, including The Little Schemer (fourth edition, 1995), The Seasoned Schemer (1995), A Little Java, A Few Patterns (1997), each of these coauthored with Matthias Felleisen, and The Reasoned Schemer (2005), coauthored with William E.
    [Show full text]
  • Mindstuff-1.Pdf
    Mindstuff: Educational Technology Beyond the Computer Michael Eisenberg Abstract. Seymour Papert’s book Mindstorms, first published in 1980, has had a profound impact on the ideas (and lives) of a generation of educational technologists and designers. This paper re-examines several of the most compelling ideas from Mindstorms in the light of recent advances that blend computational technology and materials science. In some respects, this growing détente between the physical and virtual lends greater force to Papert’s ideas than did the original examples in the book, centered as those ideas were on the then-current portrait of the desktop computer. 1. Introduction: Children, Materials, and Powerful Ideas “Before I was two years old I had developed an intense involvement with automobiles. The names of car parts made up a very substantial portion of my vocabulary: I was particularly proud of knowing about the parts of the transmission system, the gearbox, and most especially the differential. It was, of course, many years later before I understood how gears work; but once I did, playing with gears became a favorite pastime…. A modern-day Montessori might propose, if convinced by my story, to create a gear set for children. Thus every child might have the experience I had. But to hope for this would be to miss the essence of the story. I fell in love with the gears.” [Mindstorms, pp. vi-viii; emphasis in the original] Seymour Papert’s book Mindstorms1—the source of the quote above—was originally published in 1980. It may be unfamiliar to some readers, especially those too young to remember its publication.
    [Show full text]
  • Making Programming Universally Accessible and Useful
    Making Programming Universally Accessible and Useful Mitchel Resnick Media Laboratory | Massachusetts Institute of Technology 20 Ames Street | Room 020A | Cambridge, MA 02142-1308 [email protected] | 617-253-9783 | http://www.media.mit.edu/~mres Research Abstract and Goals Scratch (http://scratch.mit.edu) has been called the “YouTube of interactive media.” With its building-block programming approach and online community, Scratch makes it easy for everyone to program and share interactive games, stories, and animations – and, in the process, learn important computational ideas and problem-solving skills. But there is still work to be done: the Scratch programming application (running locally) and Scratch online community (on the web) live in different worlds, limiting possibilities for sharing and collaboration. We propose to design a new version of Scratch – called Scratch 2.0 – that is more fully integrated into the web, making it possible for people to author Scratch programs directly on websites, program interactions between Scratch and other social media websites, access and output online data, and experiment with new forms of online collaboration. In short, our goal is to explore ways of migrating Scratch to the cloud, so that programming becomes more accessible and useful for everyone. Keywords: Education Innovation, Human-Computer Interaction Technical Description Background. In 2003, our research group at the MIT Media Lab was awarded a four-year grant from the National Science Foundation to develop a new programming platform, called Scratch, that enables young people to create their own interactive stories, games, animations, and simulations – and share their creations with online. The Scratch website (http://scratch.mit.edu), launched in May 2007, has become a vibrant online community, with people sharing, discussing, and remixing one another’s Scratch projects.
    [Show full text]