Teaching
2500 F '11
 
Assignments
The Hand In
Set 1
Set 2
Set 3
Set 3h
Set 4
Set 4h
Set 5
Set 5h
Set 6
Set 7
Set 6h
Set 8
Set 7h
Set 9
Set 8h
Set 10
Set 9h
Set 11
Set 10h
Set 12

Problem Set 8

Due date: 10/31 @ 11:59pm

Programming Language: Intermediate Student Language


HtDP Problems:

Problem A1:

Edit your Bin Packing HW project according to your grader's mark ups. Be sure to fix any and all problems that your graders have discovered in your tests/functions.

We will get your submitted HW 7 files back by Friday, but until then, you can work on A2.

Problem A2:

Upgrade your Bin Packing program to full Tetris. This means whenever a tetra lands, any full rows should be eliminated and all blocks above that row should be moved down one unit.

This means you will have to write slightly more complex functions that:

  1. Determine whether or not each row is full
  2. Remove all the blocks from a full row, and
  3. Move any higher blocks down by one
Of course, the use of helper functions is suggested, and testing is not only helpful, but required.

If you want a challenge try adding score, game pause, and/or displaying the next tetra for the player. These are all optional features, so while they may get you extra credit, they cannot make up for poorly designed/written/tested code.


last updated on Tue Nov 29 19:02:43 EST 2011generated with Racket