![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Yellow/Green/Blue Tree IdeasHW:Everyone must flesh out the tree that was started in class. The file is attached below.Notes from pitt:
FILE Avaiable (Use SuperSwikiServer) File reservation system. I'd like for you to describe your improvements to the project, in the table below. This table can also serve as a notice to the class of your intent to own the file for a set block of time (so everybody doesn't try to grab it Monday at 8am). Please keep the table sorted by Date/Time
Changes by Stephen Saville, Fri 2:30pm-7:00pm I had to start over from scratch, because the original YBG Tree file that was on the web site didn't work when I tried checking it out. So things look a bit different. I started trying to model the squeak, err, eToys programming model and connect it to a more traditional view of programming. Parallel to that I also worked on listing out some of the features of squeak and putting them in some sort of partial order kinda giving an idea what order people should learn them in. I also threw out and clustered some general CS concepts that came to mind, but I didn't try to tie them in anywhere. It seems like that's something that should happen when we start planning lessons to teach Squeak programming, eh? I had to spread stuff across a bunch of pages because I couldn't come up with a better way to fit stuff on the screen and still have it all stay organized. It would be nice if eToys had a zommable UI. I know, you could probably program something like using what they give you, but built in zoom and pan for playfields (including world) would be really, really useful. Changes by Dave Uryasz, Saturday 10am-2pm I went through the Level 2 standards document and added the catagories and the things which were listed under them. Black arrows generally go to things that were explicitely listed on there, while grey arrows are things we thought of. Changes by Ben Miller, Saturday 2pm-6pm I added "Algorithms" to the theory component of the concept graph, between THEORY and Running Time. From Algorithms, I added the following heirarchy: Algorithms
Also in the THEORY component, I added the following heirarchy: Data Structures Linear Lists Queues Stacks Trees I also added a node for grammars, and an edge to it from the Models node Under Math/CS, I added a grey edge to a Graph Theory node, which points to Spanning Trees and Traversals. Some of the above is more than likely more advanced than we would like, but I think for example divide and conquer would not be too difficult a concept for high school students to understand. I wrote an rough idea for a project on divide and conquer in the lessons section. Also in the concept graph, in the organization section, I added a Heap vs. Stack node. I don't think this concept would be too difficult to teach someone who is learning programming In the "Learning Squeak Partially-Ordered Set", I added "Containers/sorting" and "tile substitution" under scripting. Erik Volkman Couldn't load Ben's file, so sent him an email asking him to renter changes. I've moved things up to the SuperSwikiServer, so hopefully we won't have anymore of these problems. Changes: Added nodes to the CS Concepts page 1-component id 2-modeling
|