MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Visualizing remixes in an online programming community

Author(s)
Liu, Di, M. Eng. Massachusetts Institute of Technology
Thumbnail
DownloadFull printable version (14.08Mb)
Other Contributors
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Advisor
Mitchel Resnick.
Terms of use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
Abstract
Scratch is a block-based programming language and associated online community that allows children and young adults to learn to build interactive games and animations - and share their creations with one another. Scratch's foremost goal is to inspire learning through exploration and creative thinking. A novel feature of its projects are their complete openness: a user can always open up another user's project to see all of its code and assets, and begin tinkering with them as if they were their own. This new revision branches from the original project, creating what we call a "remix" project. Recently, the authoring environment has been rebuilt as "Scratch 2.0", which brings what used to be a downloadable file completely online. The community website is now integral, and remixing is as easy as clicking a button. This thesis documents the rethinking and implementation of the remix tree, a visualization which allows users to explore the branching structure of changes by different users to a project over time. Additionally, we analyze changes in usage behavior and user feedback. The result is a much more usable and visually appealing tree which handles massive data sets fairly well, but continues to require iteration.
Description
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2013.
 
Cataloged from PDF version of thesis.
 
Includes bibliographical references (page 106).
 
Date issued
2013
URI
http://hdl.handle.net/1721.1/85442
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Publisher
Massachusetts Institute of Technology
Keywords
Electrical Engineering and Computer Science.

Collections
  • Graduate Theses

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.