Wentworth Institute of Technology
Division of Professional and Continuing Studies
COMP380 Section 71 - Data Structures I - Spring, 2006
Homework 4 – Bag Collection
Instructor: Bob Goldstein (617) 912-2512
bobg@vision.eri.harvard.edu
http://webpages.charter.net/tlgcreations/Courses/index.html
http://goldstein.eri.harvard.edu/courses/index.html
http://myweb.wit.edu/goldsteinr/Courses/index.html
Due Date: February 16,2006
Hand In: Printout of program code and dialogue of how it runs.
Purpose:
This homework is intended to gain practice in using the Bag Collection
Description:
The game of Bingo is played by picking tiles out of a Bag. A bingo tile has a number and a letter. The
numbers go from 1 to 75. The letters are “B”, “I”, “N”, “G”, “O”. Each letter is only associated with 15 of
the numbers. So for example the “B” tiles only go from 1 to 15, the “I” tiles go from 16 to 30, etc.
Make a class called BingoTile that holds a single Bingo Tile. It should have a constructor and a toString,
and the appropriate variables to hold it’s designation.
Implement a BingoBag collection starting from the Bag Collection in Ford and Topp.
The BingoBag collection should hold a maximum of 75 Bingo Tiles.
Your test program should pull tiles out of the BingoBag and print out each tile until the bag is empty.
Extra Credit:
Implement a Bingo Card Class. If you do not know how to play Bingo, look up on the web how to play it.
As each tile is pulled from the Bag, place a copy of it (if possible) in the BingoCard.
Implement a method of the BingoCard class that tests to see if a card is in a “Bingo” win state.
/app/work/qkd6jh-452170-2765020-homework4-doc.doc 1 12/1/2020 12/1/2020