Technology
Due Date Assignments
Ongoing Efforts Ronan -
  • Keep working on your search and replace program. 
  • Keep working on the 3-D printer.
Jake -
  • Work on administrative features of your library program.
  • Prove your formula for the relationship between faces, vertices, and edges in a network.
  • Explain why duals are dualy.
Ben and Yvonne -
  • Keep working on SolidWorks tutorials. 
  • Keep working on the 3-D printer.
Lilianna - 
  • Play with your tree program. Can you figure out what value makes the bunches of leaves just touch when the angle is 45 degrees? What do the tree look like for different angles? What happens if you make the angles asymmetric (one side leans more than the other)? How pretty can you make the tree? What would it look like if you had three branchings?
  • Now you are ready for: Write a block Sierpinski that makes a Sierpinski triangle recursively using the equilateral triangle block from above.
  • Start CAD tutorials.
Kenny -
  • Create a one-pixel wide maze with no dead ends to start with. Draw a maze in the background and program a sprite to navigate that maze successfully (not through dead reckoning and a knowledge of the maze as you program but using "sensors" and logic). Are there different kinds of mazes and is your program capable of solving all of them?
Friday, September 23 Ronan - (1) Write a program that removes the first and last digits of an integer (e.g., 45675 becomes 567). Be sure to handle special cases cleanly (no crashes). (2) Write a program that tests to see if a number is a palindrome. Examples of palindromic numbers are 454, 7117, and 4. 

Jake - Do more work on the questions you were exploring: Continue to explore 3-D shapes (semi-regular and regular). Are there more of either type? How do you carry out the search? How do you know if there can be more? Can't be more? What are you noticing about duals? Is it always true? Is there a relationship between F(aces), V(ertices), and E(dges) in your table?

Ben and Yvonne: Find two more (in addition to those discovered by the end of class) tilings that involve more than one regular polygon but still have the same arrangement of shapes at each corner of the tiling. Explore and test using the web tool (see below).

Lilianna - Do one of these problems:

Simulate the "chaos game" from last year. Draw an equilateral triangle, place a sprite down in it, repeatedly pick one of the three vertices and move the sprite to the midpoint between its current location and the chosen vertex. Do this a lot and make a dot each time.

Import or draw a maze in the background and program a sprite to navigate that maze successfully (not through dead reckoning and a knowledge of the maze as you program but using sensors and logic). Are there different kinds of mazes and is your program capable of solving all of them?


Kenny - Really finish problem 1 below. Email me with questions. Think about looping tasks.
 
Tuesday, September 20 Jake - Continue to explore 3-D shapes (semi-regular and regular). Are there more of either type? How do you carry out the search? How do you know if there can be more? Can't be more? What are you noticing about duals? Is it always true? Is there a relationship between F(aces), V(ertices), and E(dges) in your table?

Ben and Yvonne: Ben thinks that only regular polygons (all angles and sides are equal) that tile a plane are triangles, squares, and hexagons. What tilings involve more than one regular polygon but still have the same arrangement of shapes at each corner of the tiling? Explore and test using this web tool. 

Lilianna - Try problem 2 below now that you have done 1.
Kenny - Finish problem 1 below. Email me with questions. Think about looping tasks.
Ronan - Complete the tasks below and start looking over your new text to see if there are next projects in the early pages that intrigue you.
 
Friday, September 16

CAD/CAM Group (Jake, Ben, Yvonne)

Complete your list of 2-D and 3-D shapes and formulas for perimeter and area for the 2-D shapes and volume and surface area for the 3-D figures. You can work together and consult online resources.

Spend some time during SREPT experimenting with the vat of colorful shapes that click together to make solids (Polydron). What questions and observations come up as you build shapes? Record at least three interesting ones. What happens if you try to tile the shapes in a 2-D pattern on the table? Which shapes tile and which do not?

Java "Group" (Ronan)

  • Review page 21 -32 of this handout carefully (take notes as needed).
  • Write a program that asks the user for a circumference and prints out the radius and area of the circle.
  • Write a program that asks for a 4 digit whole number, stores it in an integer variable and then prints the four digits separately (review arithmetic operations in Java).

B .Y.O.B. Group (Lilianna, Kenny)

  1. Download the B.Y.O.B. program and install it on your home computer if it is not there yet. Click here.
  2. Work on one of these projects:
    1. Ask the user for a width and a height and then draw a graph paper grid with as many boxes wide and high as requested.
    2. Ask the user for a whole number and then draw that many dots around a circle. For example, if the user enters 4, it will look like four corners of a square. If they enter 7, it will look like: