Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Data Structures I - Bingo Game Homework 4 - Wentworth Institute of Technology, Assignments of Data Structures and Algorithms

Information about homework 4 for the data structures i course offered by wentworth institute of technology in the spring of 2006. The assignment involves creating a bingotile class and implementing a bingobag collection for a bingo game. Students are required to write a test program that pulls tiles out of the bingobag and prints each tile until the bag is empty. Extra credit involves creating a bingocard class and implementing methods to test if a card is in a 'bingo' win state. Contact information for the instructor and due date.

Typology: Assignments

Pre 2010

Uploaded on 08/19/2009

koofers-user-x26
koofers-user-x26 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
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

Partial preview of the text

Download Data Structures I - Bingo Game Homework 4 - Wentworth Institute of Technology and more Assignments Data Structures and Algorithms in PDF only on Docsity!

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- 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, 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/